Method, apparatus, and computer program product for setting a benchmark conversion rate

ABSTRACT

Provided herein are systems, methods and computer readable media for setting a benchmark conversion rate. An example method comprises accessing user search data, the user search data generated by a user interacting with a promotion and marketing service to identify a requested promotion, generating an identification pair for the search data, the identification pair comprising an identification of a promotion tuple and a geographic subdivision, generating a search velocity based on the generated identification pairs, accessing a conversion rate for the promotion tuple in a plurality of geographic subdivisions and setting a benchmark rate for a promotion tuple, the benchmark rate corresponding to the conversion rate of a subdivision of the plurality of subdivisions based on the subdivision satisfying at least one of a search velocity threshold, a prime merchant metric threshold or a conversion rate threshold.

CROSS REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.14/316,264, titled “METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FORSETTING A BENCHMARK CONVERSION RATE” filed Jun. 26, 2014 and claimspriority to U.S. Provisional Patent Application No. 61/939,193, titled“METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR FORECASTING DEMAND”filed on Feb. 12, 2014, and U.S. patent application Ser. No. 13/826,333,titled “METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR FORECASTINGDEMAND” filed Mar. 14, 2013, which claims priority to U.S. ProvisionalPatent Application No. 61/730,046, titled “METHOD AND APPARATUS FORMATCHING SUBSCRIBER DEMAND WITH MERCHANT/INVENTORY SUPPLY” filed on Nov.26, 2012”, and U.S. Provisional Application No. 61/709,623, titled“MERCHANT SIDE CROSS-CATEGORY DEAL DIVERSITY”, filed Oct. 4, 2012, eachof which is hereby incorporated by reference.

The present application is related to U.S. patent application Ser. No.13/803,445, filed Mar. 14, 2013, titled “METHOD, APPARATUS, AND COMPUTERPROGRAM PRODUCT FOR SALES PIPELINE AUTOMATION”, U.S. patent applicationSer. No. 14/106,203, filed Dec. 13, 2013, titled “METHOD, APPARATUS, ANDCOMPUTER PROGRAM PRODUCT FOR PROVIDING A SEARCH FEEDBACK SYSTEM”, U.S.patent application Ser. No. 13/826,866, filed Mar. 14, 2013, titled“METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR CALCULATING APROVIDER QUALITY SCORE”, U.S. patent application Ser. No. 13/826,757,filed Mar. 14, 2013, titled “METHOD, APPARATUS, AND COMPUTER PROGRAMPRODUCT FOR DETERMINING A PROVIDER RETURN RATE”, U.S. patent applicationSer. No. 13/804,403, filed Mar. 14, 2013, titled “METHOD, APPARATUS, ANDCOMPUTER PROGRAM PRODUCT FOR IDENTIFYING A SERVICE NEED VIA APROMOTIONAL SYSTEM”, U.S. patent application Ser. No. 13/804,316, filedMar. 14, 2013, titled “METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCTFOR DETERMINING CLOSING METRICS”, and U.S. patent application Ser. No.13/830,243, filed Mar. 14, 2013, titled “CAPACITY CALCULATOR”, and U.S.patent application Ser. No. 13/803,275, filed Mar. 14, 2013, titled“MERCHANT SIDE CROSS-CATEGORY DEAL DIVERSITY” each of which is herebyincorporated by reference.

FIELD

Embodiments of the invention relate, generally, to managing a salespipeline.

BACKGROUND

Applicant has discovered problems with current methods for managing asales pipeline. In some examples, a plurality of manual steps in theprocess may be eliminated and/or the accuracy may be improved. Throughapplied effort, ingenuity, and innovation, Applicant has solved many ofthese identified problems by developing a solution that is embodied bythe present invention, which is described in detail below.

BRIEF SUMMARY

In general, embodiments of the present invention provided herein includesystems, methods and computer readable media for managing a salespipeline.

In some embodiments, a method may be provided comprising accessing usersearch data, the user search data generated by a user interacting with apromotion and marketing service to identify a requested promotion,generating an identification pair for the search data, theidentification pair comprising an identification of a promotion tupleand a geographic subdivision, generating a search velocity based on thegenerated identification pairs, accessing a conversion rate for thepromotion tuple in a plurality of geographic subdivisions, and setting abenchmark rate for a promotion tuple, the benchmark rate correspondingto the conversion rate of a subdivision of the plurality of subdivisionsbased on the subdivision satisfying at least one of a search velocitythreshold, a prime merchant metric threshold or a conversion ratethreshold.

In some embodiments, the method may further comprise identifying one ormore providers in the subdivision having the benchmark rate, andtransmitting a classification of the one or more providers to a leadgeneration module. In some embodiments, the method may further compriseanalyzing a subdivision, and generating two or more regions within thesubdivision based on one or more of subscriber density or populationdensity.

In some embodiments, the benchmark rate corresponding to the conversionrate of a subdivision of the plurality of subdivisions is further basedon the subdivision satisfying an inventory threshold. In someembodiments, the benchmark rate corresponding to the conversion rate ofa subdivision of the plurality of subdivisions is further based on thesubdivision satisfying a prime merchant metric threshold. In someembodiments, the benchmark rate corresponding to a predefined percentileof one or more conversion rates of a plurality of subdivisions of adivision peer group in an instance in which user search data fails tomeet a predetermined threshold. In some embodiments, the benchmark ratecorresponding to a conversion rate of a second identification pairmeeting a given set of supply conditions, the identification paircorresponding to a subdivision of a division peer group, in an instancein which user search data fails to meet a predetermined threshold.

In some embodiments, a computer program product may be providedcomprising at least one computer-readable storage medium havingcomputer-executable program code instructions stored therein, thecomputer-executable program code instructions comprising program codeinstructions for accessing user search data, the user search datagenerated by a user interacting with a promotion and marketing serviceto identify a requested promotion, generating an identification pair forthe search data, the identification pair comprising an identification ofa promotion tuple and a geographic subdivision, generating a searchvelocity based on the generated identification pairs, accessing aconversion rate for the promotion tuple in a plurality of geographicsubdivisions, and setting a benchmark rate for a promotion tuple, thebenchmark rate corresponding to the conversion rate of a subdivision ofthe plurality of subdivisions based on the subdivision satisfying atleast one of a search velocity threshold, a prime merchant metricthreshold or a conversion rate threshold.

In some embodiments, the computer-executable program code instructionsfurther comprise program code instructions for identifying one or moreproviders in the subdivision having the benchmark rate, and transmittinga classification of the one or more providers to a lead generationmodule. In some embodiments, the computer-executable program codeinstructions further comprise program code instructions for analyzing asubdivision, and generating two or more regions within the subdivisionbased on one or more of subscriber density or population density.

In some embodiments, the benchmark rate corresponding to the conversionrate of a subdivision of the plurality of subdivisions is further basedon the subdivision satisfying an inventory threshold. In someembodiments, the benchmark rate corresponding to the conversion rate ofa subdivision of the plurality of subdivisions is further based on thesubdivision satisfying a prime merchant metric threshold. In someembodiments, the benchmark rate corresponding to a predefined percentileof one or more conversion rates of a plurality of subdivisions of adivision peer group in an instance in which user search data fails tomeet a predetermined threshold In some embodiments, the benchmark ratecorresponding to a conversion rate of a second identification pairmeeting a given set of supply conditions, the identification paircorresponding to a subdivision of a division peer group, in an instancein which user search data fails to meet a predetermined threshold.

In some embodiments, an apparatus may be provided comprising at leastone processor and at least one memory including computer program code,the at least one memory and the computer program code configured to,with the processor, cause the apparatus to at least access user searchdata, the user search data generated by a user interacting with apromotion and marketing service to identify a requested promotion,generate an identification pair for the search data, the identificationpair comprising an identification of a promotion tuple and a geographicsubdivision, generate a search velocity based on the generatedidentification pairs, access a conversion rate for the promotion tuplein a plurality of geographic subdivisions, and set a benchmark rate fora promotion tuple, the benchmark rate corresponding to the conversionrate of a subdivision of the plurality of subdivisions based on thesubdivision satisfying at least one of a search velocity threshold, aprime merchant metric threshold or a conversion rate threshold.

In some embodiments, the at least one memory and the computer programcode are further configured to, with the processor, cause the apparatusto identify one or more providers in the subdivision having thebenchmark rate, and transmit a classification of the one or moreproviders to a lead generation module. In some embodiments, the at leastone memory and the computer program code are further configured to, withthe processor, cause the apparatus to analyze a subdivision, andgenerate two or more regions within the subdivision based on one or moreof subscriber density or population density.

In some embodiments, the benchmark rate corresponding to the conversionrate of a subdivision of the plurality of subdivisions is further basedon the subdivision satisfying an inventory threshold. In someembodiments, the benchmark rate corresponding to the conversion rate ofa subdivision of the plurality of subdivisions is further based on thesubdivision satisfying a prime merchant metric threshold. In someembodiments, the benchmark rate corresponding to a predefined percentileof one or more conversion rates of a plurality of subdivisions of adivision peer group in an instance in which user search data fails tomeet a predetermined threshold. In some embodiments, the benchmark ratecorresponding to a conversion rate of a second identification pairmeeting a given set of supply conditions, the identification paircorresponding to a subdivision of a division peer group, in an instancein which user search data fails to meet a predetermined threshold.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

Having thus described embodiments of the invention in general terms,reference will now be made to the accompanying drawings, which are notnecessarily drawn to scale, and wherein:

FIG. 1 is a flowchart showing an exemplary process for facilitatingsales pipeline automation;

FIG. 2a shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 2b shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 2c shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein;

FIG. 3 shows a flow chart showing an exemplary process of Quantum Leadthat includes analyzing demand and merchant data and providingprioritized merchant data in accordance with some embodiments discussedherein;

FIG. 4 shows a flow chart showing an exemplary process of facilitatingQuantum that includes generating an adjusted demand to a remote devicein accordance with some embodiments discussed herein;

FIG. 5A-5D show example graphical user interface displays that may bepresented by various components of systems in accordance with someembodiments discussed herein;

FIG. 6A is a block diagram showing exemplary search feedback system forreceiving consumer search data and providing searched attributesassociated with a location (e.g., location specific data) and/or with acategory (e.g., category specific data);

FIG. 6B then shows an example method, namely process 650, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) for generating demand basedon real time demand and predicted demand;

FIG. 6C then shows an example method, namely process 650, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) for utilizing consumer searchdata for generating a real time demand indication, in accordance withsome embodiments discussed herein;

FIGS. 6D and 6E show example methods that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for utilizing a search index, and in particular ataxonomy search index and a merchant search index, respectively, inaccordance with some embodiments discussed herein;

FIG. 6F shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for assigning a hyper location using a latitudelongitude pair generated at the time of user search data, in accordancewith some embodiments discussed herein;

FIG. 6G shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for modifying the real time demand in accordance witha conversion rate, in accordance with some embodiments discussed herein;

FIG. 6H shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for determining the conversion rate, in accordancewith some embodiments discussed herein;

FIG. 6I shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for identifying whether there is sufficient inventoryto meet existing demand;

FIG. 6J shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for determining the promotion area for the one or morepromotions;

FIG. 6K shows an example method that may be executed by one or moremachines (some examples of which are discussed in connection with FIGS.1, 2 a, and/or 3) for providing a dashboard;

FIG. 6L shows an exemplary screenshot of the dashboard, in accordancewith some embodiments discussed herein;

FIG. 7 shows a flow chart showing an exemplary process of facilitatingQuantum Lead that includes identifying new supply in accordance withsome embodiments discussed herein;

FIG. 8 shows a flow chart showing an exemplary process of facilitatingQuantum Lead that includes assigning leads in accordance with someembodiments discussed herein;

FIG. 9 shows an exemplary screenshot of a prioritized call list;

FIG. 10 shows a flowchart showing an exemplary process for calculating aprobability that a consumer may buy a particular virtual offer andgenerating a ranked list of virtual offers, in accordance with someembodiments discussed herein;

FIG. 11 shows a flowchart showing an exemplary process for calculating asupply source quality score, in accordance with some embodimentsdiscussed herein;

FIG. 12 shows a flowchart showing an exemplary process for calculatingan assignment probability number for each of one or more salesresources, in accordance with some embodiments discussed herein;

FIG. 13 shows a flowchart showing an exemplary process for determiningwhether and when to de-allocate a supply source from a sales resource,in accordance with some embodiments discussed herein; and

FIG. 14 shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with some embodimentsdiscussed herein.

DETAILED DESCRIPTION

Embodiments of the present invention now will be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all embodiments of the inventions are shown. Indeed, embodimentsof the invention may be embodied in many different forms and should notbe construed as limited to the embodiments set forth herein; rather,these embodiments are provided so that this disclosure will satisfyapplicable legal requirements. Like numbers refer to like elementsthroughout.

Definitions

As used herein, the terms “data,” “content,” “information” and similarterms may be used interchangeably to refer to data capable of beingcaptured, transmitted, received, displayed and/or stored in accordancewith various example embodiments. Thus, use of any such terms should notbe taken to limit the spirit and scope of the disclosure. Further, wherea computing device is described herein to receive data from anothercomputing device, it will be appreciated that the data may be receiveddirectly from the another computing device or may be received indirectlyvia one or more intermediary computing devices, such as, for example,one or more servers, relays, routers, network access points, basestations, and/or the like, sometimes referred to herein as a “network.”Similarly, where a computing device is described herein to send data toanother computing device, it will be appreciated that the data may besent directly to the another computing device or may be sent indirectlyvia one or more intermediary computing devices, such as, for example,one or more servers, relays, routers, network access points, basestations, and/or the like.

In some embodiments, a host system may be implemented as a promotionalsystem to offer promotions to a consumer. A promotion and marketingservice may utilize a host system, such as a promotional system, tooffer such promotions. A “promotion and marketing service” may providepromotion and/or marketing services on behalf of one or more providers(e.g., one or more merchants, retailers, etc.) that are offering one ormore instruments that are redeemable for goods, services, experiencesand/or the like. The promotion and marketing service is furtherconfigured to illustrate or otherwise inform one or more consumers ofthe availability of one or more instruments in the form of one or moreimpressions. In some examples, the promotion and marketing service mayalso take the form of a redemption authority, a payment processor, arewards provider, an entity in a financial network, a promoter, an agentand/or the like. As such, the service is, in some example embodiments,configured to present one or more promotions via one or moreimpressions, accept payments for promotions from consumers, issueinstruments upon acceptance of an offer, participate in redemption,generate rewards, provide a point of sale device or service, issuepayments to providers and/or or otherwise participate in the exchange ofgoods, services or experiences for currency, value and/or the like.

A “promotion” may be a deal purchased by a consumer from a promotionalsystem, and may be considered an agreement for a particular provider toprovide a service or good (e.g., a discounted service or good) to theconsumer. A promotion may include, but is not limited to, any type ofoffered, presented or otherwise indicated reward, discount, coupon,credit, deal, incentive, discount, media or the like that is indicativeof a promotional value or the like that upon purchase or acceptanceresults in the issuance of an instrument that may be used toward atleast a portion of the purchase of particular goods, services and/orexperiences defined by the promotion. An example promotion may be a dealoffer whereby a running shoes company or intermediary (e.g., promotionprovider) offers $50 of value toward the purchase of running shoes inexchange for $25. In some examples, the promotion defines an acceptedvalue (e.g., a cost to purchase the promotion), a promotional value(e.g., the value of the resultant instrument beyond the accepted value),a residual value (e.g., the value upon return or upon expiry of one ormore redemption parameters), one or more redemptions parameters and/orthe like. For example, and using the running shoes company promotion asan example, the accepted value is $25 and the promotional value is $50.In this example, the residual value may be equal to the accepted value.

An “instrument” associated with a promotion may include, but is notlimited to, any type of gift card, tender, electronic certificate,medium of exchange, voucher, or the like that embodies the terms of thepromotion from which the instrument resulted and may be used toward atleast a portion of the purchase, acquisition, procurement, consumptionor the like of goods, services and/or experiences. In some examples, theinstrument may take the form of tender that has a given value that isexchangeable for goods, services and/or experiences and/or a reductionin a purchase price of a particular good, service or experience. In someexamples, the instrument may have multiple values, such as an acceptedvalue, a promotional value and/or a residual value. For example, usingthe aforementioned running shoes company as the example provider, anelectronic indication in a mobile application that shows $50 of value tospend at the running shoes company. In some examples, the accepted valueof the instrument is defined by the value exchanged for the instrument.In some examples, the promotional value is defined by the promotion fromwhich the instrument resulted and is the value of the instrument beyondthe accepted value. In some examples, the residual value is the valueafter redemption, the value after the expiry or other violation of aredemption parameter, the return or exchange value of the instrumentand/or the like.

A “provider” may be considered a merchant, retailer, or other providerof goods or services that offers a promotion, as agreed upon with thepromotion and marketing service affiliated with the promotional system.A provider may include, but is not limited to, a merchant, businessowner, consigner, shopkeeper, tradesperson, vender, operator,entrepreneur, agent, dealer, retailer, organization or the like that isin the business of a providing a good, service or experience to aconsumer, facilitating the provision of a good, service or experience toa consumer and/or otherwise operating in the stream of commerce. Forexample, a provider may take the form of a running shoes company thatsells attire that is generally used by a person who runs or participatesin athletic activities.

An “impression” may be considered a communication advertising an offerto purchase a promotion from a promotional system. An impression mayinclude a communication, a display, or other perceived indication, suchas a flyer, print media, e-mail, text message, application alert, mobileapplications, other type of electronic interface or distribution channeland/or the like, of one or more promotions. For example, and using theaforementioned running company as the example provider, an e-mailcommunication sent to consumers that indicates the availability of a $25for $50 toward running shoes promotion.

Impressions are therefore provided to “consumers,” including, but notlimited to, a client, customer, purchaser, shopper, user of thepromotional system or the like who may be in the position to or doesexchange value for one or more instruments under the terms defined bythe one or promotions. For example, and using the aforementioned runningshoes company as the example provider, an individual who is interestedin purchasing running shoes. A “consumer” may be identified by one ormore profiles, or sub-profiles, where each profile or sub-profileincludes one or more consumer attribute that describes the consumer.Consumer attributes may include, but are not limited to, the consumer'sname, consumer's age, consumer's location (e.g., “home”, “work”, orother visited places such as future vacation locations, cities thatfriends and/or family live in locations, business trip locations and thelike), consumer's gender, consumer's tenure using the promotion system,consumer's email domain, consumer's IP address, consumer's occupation,consumer's educational background, consumer's previously accepted and/orrejected promotion program offerings, consumer's gender and the like.The consumer attributes may be inputted into the consumer's profile bythe consumer, or collected by components within the promotion system 100and inputted into the consumer's profile.

“Forecasting demand” may include or otherwise enable a prediction ofthose offers that a consumer (e.g., a client, customer, purchaser,shopper, user or the like who may be in the position to or does exchangevalue for one or more offers) will likely purchase, if offered, and, assuch, enables the prioritization of promotions associated with suchoffers. Forecasting demand may further facilitate the prediction ofthose promotions or associated offers which may result in greaterinterest, revenue, higher margin, offer diversity and/or the like.

A “virtual offer” may be an offer that is constructed, for example, by acomputer algorithm, but may not be offered for sale by a seller noroffered to a consumer. A virtual offer, in some embodiments, may includea category and/or a sub-category, (e.g., massage as a category and/orshoulder massage as a sub-category. The offer may further include alocation and/or a hyper-local region (e.g., a location of Chicago, Ill.and/or hyper-local region of Wrigleyville). The virtual offer mayfurther include a type of offer (e.g., two for one).

A “forecasted demand”, which may be referred alternatively as a demandforecast or a projected demand, may be calculated by calculating aprobability that a particular user would buy a particular offer in aparticular time frame for at least a portion of a plurality of users andfor at least of a portion of one or more virtual offers. An estimatednumber of units to be sold may then be determined, or projected, for atleast a portion of the one or more virtual offers as a function of atleast the probability associated with each of the one or more virtualoffers. The probability may be based on associated consumer data relatedto, for example, at least one of a location, a gender, prior purchasehistory, personalization signals, seasonality or any combination thereofand by simulating a plurality of virtual offers in a plurality ofhyper-local regions, using for example a virtual offer constructionalgorithm, and applying the associated consumer data to the virtualoffers. The output, forecasted demand, may comprise at least one or morevirtual offers and a demanded quantity of at least a portion of the oneor more virtual offers.

“Adjusted Demand” is the forecasted demand adjusted based on externalfactors (e.g., seasonality etc.).

Analyzing “explicit data,” such as user-provided data in user profiles,preferences, and/or promotion purchase history, for example, may allowthe promotional system to better target promotion types or impressionsto consumers. A consumer may be more likely to purchase a promotion ifthe impression advertising the promotion is of interest to the consumerthan if the associated promotion was selected at random.

Additionally or alternatively, accessing “implicit data,” data that maybe user-provided for a purpose other than for use on the promotionalsystem and/or detected by the promotional system, may allow apromotional system to gather information on consumer behaviors,preferences and preferred locations. Example implicit data may includedata indicative of a consumer's browsing and/or search history, detectedlocation, or the consumer's social network profile information, forexample.

A “client device” may be a device or module operable to access a website(e.g., perhaps using a web browser) or execute a mobile application,such as a laptop, mobile phone, tablet, personal computer, or the like.A client device may place a request, such as in response to a consumeractivity facilitated by a user interface such as, without limitation,clicking a link, selecting particular text or image data, and/orinputting or entering data.

A “search” may include operations performed by a consumer or other uservia a client device, wherein text, parameters, tags, or other terms aresearched against one or more electronically stored documents, dataentries, records, files, or the like. In some embodiments, a “search”may be performed by navigating a hierarchical data structure, such as adata structure organized by location/hyper-location orcategory/sub-category. In some embodiments, portions of a search stringmay be pre-populated (e.g., a location or hyper-location portion) by theclient device or other processing circuitry. In some embodiments, asearch may be performed using a single field or any array of fields.

The search may be executed by a “search system” running on the clientdevice, which may include a search engine configured to search forinformation on the World Wide Web (www) or on a remote server. In someembodiments, the “search engine” may be configured to search forinformation hosted via a website or a web server of an application, andto provide “search results.” “Search results” may be transmitted orotherwise provided for display to the consumer or other user via theclient device as a list of information (e.g., list of web pages, imagesor the like) related to the search. The search system may be configuredsuch that particular promotions may be offered to consumers based onrelevance determinations. For example, in U.S. patent application Ser.No. 13/829,581, which is entitled “Promotion Offering System”, was filedMar. 14, 2013, and which is hereby incorporated by reference in itsentirety, algorithms are disclosed for providing consumers relevantpromotions in response to consumer initiated searches.

“Consumer search data” may include one or more search terms (e.g., text,characters, etc.) that are input by consumers into an interface (e.g.,one or more fields displayed by a graphical user interface) of thesearch system. The consumer search data is used by the search system,perhaps in connection with other data or terms (e.g., pre-populateddata, categories, etc.), to execute the search. In some embodiments,consumer search data is stored with an association to consumeridentification information (e.g., a consumer ID).

Consumer search data may be translated or otherwise identified by thesearch system as “searched attributes”. “Searched attributes” may beparts of a promotion to which the consumer search data is translated orconverted to. For example, if a consumer searches “Chinese restaurant”,“Chinese restaurant” may be the consumer search data. Embodiments of thepresent invention may store a “searched attribute” for one or more of acategory (e.g., “food and drink”), a sub-category (e.g., “Asiancuisine”), a deal type (e.g., “date night”) or the like. In someembodiments, translation to “searched attributes” is performed in thecase of misspellings (e.g., “cinese restaurant”), partial input (e.g.,“Chinese rest”), or the like.

A “consumer ID” may include information or data for identifying aconsumer such as, for example, a username, password, user ID, loginname, sign-in name, unique name, email address, pin number, accountnumber, identification number, IP address, and the like.

“Aggregation” refers to processes whereby data is gathered,consolidated, formatted, stored, and expressed in summary form or acommon format. “Aggregation” by consumer or “consumer aggregation” mayrefer to gathering, consolidating, formatting, storing, and expressingdata (e.g., searched attributes) associated to a particular consumer orconsumer ID. For example, consumer aggregation may include accessing orexpressing consumer search data or searched attributes associated withthe consumer (or consumer ID) received from the search system or from aparticular client device. Similarly, aggregation by location or locationaggregation may refer to gathering, consolidating, formatting, storing,and expressing data (e.g., consumer search data or searched attributes)associated with a particular location (e.g., Chicago) or hyper-location(e.g., Wrigleyville neighborhood of Chicago).

“Determining relevance” may include determining which of a plurality ofconsumer promotions to present to a consumer. The plurality of consumerpromotions may be for goods and or for services.

A “promotion tuple” may comprise at least a category, price information(e.g., a price, prices, band of prices, or the like), and informationindicative of a location (e.g., a geographic area). In some embodiments,the promotion tuple may comprise price information indicative of one ormore bands of prices or a single price.

An “identification pair” may be comprised of at least two searchedattributes or, in some embodiments, a first classification and a secondclassification, the first classification identifying a category,subcategory, service or merchant, and the second classificationidentifying a location, sub-location, promotion area, or any geographicindication. In some embodiments, an identification pair may comprise acategory (of a product, service or experience) and a location, theidentification pair indicative of one or more promotions. For example,in some embodiments, the user search data may be received and a categoryspecific data and location specific data may be extracted or otherwiseidentified. The location specific data and category specific data may beindicative or able to be associated with a promotion, promotion tuple inthe context of calculating a real time demand, or a virtual offer in thecontext of forecasting a predicted demand.

Overview

The methods, apparatus and computer program products described hereinare operable to automate a sales pipeline by implementing and/orotherwise executing a demand module, a supply identification module, anassignment module and/or the like. In some examples, the demand modulemay be configured to determine a forecasted demand for offers (e.g., anytype of presented or otherwise indicated reward, discount, coupon,credit, deal, incentive, discount, media or the like that is indicativeof an offered value or the like that upon purchase or acceptance resultsin the issuance of an instrument that may be used toward at least aportion of the purchase of particular goods, services and/or experiencesdefined by the offer). The forecasted demand provides or otherwiseenables a prediction of those offers that a consumer (e.g., a client,customer, purchaser, shopper, user or the like who may be in theposition to or does exchange value for one or more offers) will likelypurchase if offered, and, as such, enables the prioritization of thesales of the forecasted or demanded offers, which may result in greaterinterest, revenue, higher margin, offer diversity and/or the like.

In some examples, however, one or more demanded offers may already bepresent in an inventory. In such examples, the method, apparatus andcomputer program product described herein is operable to modify orotherwise adjust the demand to account for a current inventory ofoffers. Other adjustments may also be performed, based on seasonality,economic conditions, geography, climate and/or the like.

Once a set of adjustments has been performed, in some exampleembodiments, one or more merchants (e.g., a provider, business owner,consigner, shopkeeper, tradesperson, vender, operator, entrepreneur,agent, dealer, organization or the like that is in the business of aproviding a good, service or experience to a consumer, facilitating theprovision of a good, service or experience to a consumer and/orotherwise operating in the stream of commerce) may be identified thatmay provide the demanded offer. Merchants that provide the same orsimilar goods, services or experiences may be matched or otherwiseassigned to the demanded offers. As such, a merchant may be assignedzero or more virtual offers.

Using a series of ranking metrics described herein, the merchants may beranked. In some examples, the ranking may be based on expected revenue,business objectives, sales timeline, sales probability, merchantdiversity, offer diversity and/or the like. In some examples, the rankedlist may provide an example ordering in which sales calls may be made.

The ranked list of merchants may then be programmatically assigned toone or more sales resources, such as a sales representative, a salescontractor, a marketing person or team, an email distribution list, aself-service tool, or the like. In some examples, the assignment may bedynamically modified based on current resources, need, diversity,probability to close, time to close, business objectives and/or thelike, while in other examples an assignment may be removed in aninstance in which there is no longer a demand for the particularservice, good or experience provided by the particular merchant.Alternatively or additionally, each merchant or demanded offer may beassigned a value, in such cases the value may be suggestive of a bountyor reward system, such as a commission or a bonus for the salesresource.

Sales Process Automation

By way of further example, FIG. 1 is a block a diagram that illustratesan exemplary process for sales pipeline automation. In general, theprocess 100 may forecast or otherwise determine a demand via the demandmodule 102. The demand illustrates and/or otherwise identifies thepromotions a consumer is willing to purchase in a local area (e.g.,category and/or sub category of a good, service or experience, a price,a location, a time and/or the like). In some examples, the forecasteddemand may be indicative of demanded promotions in the local area,however in other examples the demand may be indicative of a demandedgood, service or experience in the local area irrespective of an offer.

In order to facilitate the forecasted demand, the demand module 102 isconfigured to generate one or more virtual offers, such as via thetaxonomy model 108 and/or the virtual offer builder 110. Virtual offersare representative of one or more offers that could be offered in alocal area. For example, $25 massages or $10 for $20 at a local clothingstore. Additional description relating to the building the one or moreoffers is further described at least with respect to the virtual offergeneration module 202 in FIG. 2 a.

The virtual offers may then be analyzed to determine the probabilitiesthat a particular consumer, such as a current or past subscriber, wouldpurchase the particular virtual offer, such as via the demandcalculation engine 114. The demand calculation engine 114 may beconfigured to generate or otherwise determine the probabilities based onfor example past purchase history in a consumer database 112, historicdemand for similar offers, search engine results, survey results,current market trends and/or the like. Using the probabilities (e.g.,the probability that each of a plurality of consumers would buy each ofa plurality of virtual offers), a forecasted demand may be generated.Additional description relating to determining the probability that aparticular customer would purchase a particular offer is furtherdescribed at least with respect to the probability generation module 204in FIG. 2 a.

In some example embodiments, the demand module 102 may adjust theforecasted demand based on factors, such as, but not limited toseasonality, economic conditions, holidays, weather and/or the like.Additional description relating to demand adjustment is furtherdescribed at least with respect to the demand adjustment module 206 inFIG. 2a . Additionally or alternatively, with the introduction of searchand browse functionality and the capture of data therefrom on apromotion and marketing service (e.g., as may be provided by thepromotion system 1410 described later), demand may be inferred and realtime demand may be calculated. Subsequently, the real time demand may beused in conjunction with the forecasted (or predicted demand) todetermine a total demand. Additional description relating to the use ofuser search data in the determination of a total demand is furtherdescribed in FIGS. 6A-6L. The demand module 102 is configured to outputa forecasted demand to the supply ID module 104.

In some example embodiments, a supply identification (ID) module 104 isconfigured to ingest the forecasted demand, adjusted demand or acombination thereof. Using the forecasted demand, the supply ID module104 is further configured to reduce or otherwise further modify theforecasted demand based on current offers in an inventory to determine aresidual demand. Additional description relating to residual demandcalculation is further described at least with respect to the residualdemand calculation module 224 in FIG. 2 b.

Using the residual demand, the supply ID module 104 is configured toassign each offer defined by the residual demand to one or moremerchants in an instance in which the merchant is able to provide thesame or similar goods, services and/or experiences as defined by theforecasted demand. In some examples, the one or more merchants may bedetermined based on a global listing of merchants stored in a merchantdatabase. As such, to the extent the merchant provides a good, serviceor experience that matches or is related to a demanded offer, thedemanded offer may be assigned or otherwise linked to that merchant.Each merchant may therefore be assigned zero or more demanded offers asdefined by the residual demand. As such, each demanded offer may beassigned to zero or more merchants.

The supply ID module 104 may then further be configured to assign asales value score to each of the merchants. In some examples, the salesvalue score may be determined according to one or more criteria, such asexpected bookings, quality, risk, a time and/or probability to close acontract and/or the like. Based on the scores, the merchants may beprioritized and output to an assignment module 106. Further descriptionof the sales value score is further described at least in sales valuescore calculation module 228 in FIG. 2b . Using the sales value score,the supply ID module 104 may output a ranked list of merchants to theassignment module 106.

In some example embodiments, the assignment module 106 is configured toreceive a ranked list of merchants. Using the ranked list of merchants,the assignment module 106 may further be configured to assign themerchants in the ranked list of merchants to one or more salesresources. The assignment module 106 may also be configured tore-prioritize and/or re-assign merchants to sales resources according toa predetermined time period, such as daily, weekly or the like. Furtherdescription of lead assignment is further described at least withrespect to lead assignment module 246 in FIG. 2 c.

The assignment module 106 may also be configured to provide aprioritized sales call list for one or more sales resources. In someexamples, the prioritized list may be based on a current businessobjective, a portfolio mix, a priority, a commission and/or the like. Insome examples, the sales list may be dynamically reprioritized based oncurrent sales, a change in business objectives, an inventory change, ademand change and/or the like. Further description of generating aprioritized sales call list is further described at least with respectto prioritized list generation module 258 in FIG. 2 c.

The assignment module 106 may also be configured to provide feedbackand/or updates to one or more of the demand module 102, the supply IDmodule 104, the assignment module 106 or the like. The feedback and/orupdates may be related to a contract being closed, time to close, anumber of calls, a contact person or the like. Further description offeedback and/or updates is further described at least with respect tothe feedback and update module 270 in FIG. 2 c.

Demand Forecasting

FIG. 2a shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with demand module 102shown, for example, in process 100. Demand module 102 may includevirtual offer generation module 202, a probability generation module204, a demand adjustment module 206 and/or the like to generate aforecasted demand or one or more virtual offers. Each block of thecircuit diagrams, and combinations of blocks in the circuit diagrams,may be implemented by special purpose hardware-based computer systemsthat perform the specified functions or steps, or combinations ofspecial purpose hardware and computer instructions.

The virtual offer generation module 202 may utilize input from orotherwise embody a taxonomy model 108 and/or a virtual offer builder 110to generate a virtual offer. In some example embodiments, the taxonomymodel 108 defines a hierarchical structure of service categories andsub-categories that may be found in one or more local or hyper-localareas. For example, the taxonomy model 108 may define “food and dining”as a category and “Italian” as a sub-category. Alternatively oradditionally, the taxonomy model 108 may define a hierarchical structurethat is based on location, sub-locations, and/or hyper-local regions,such as any of country, state, county, city, zip code, neighborhood, orstreet. For example, a location may be “Chicago” and a hyper-localregion may be “north side”. Alternatively or additionally, the taxonomymodel 108 may define a hierarchical structure that is based on targetconsumer categories such as “family fun” or “high octane adventures.”One or more of the sub-categories may then be specific to the targetconsumer category, for example, “children under 5” or “high speed”respectively. Additional sub-categories may be general, such as “dining”or “in your neighborhood”. In another embodiment, the taxonomy model 108may define a hierarchical structure that is based on service. Forexample, “wine/food” or “Swedish massage”. Virtual offer builder 110 maygenerate a virtual offer based on such hierarchical structure, such thata virtual offer may comprise a service, a category and sub-category. Forexample, “wine/food”, “food and dining” and “Italian” may be service,category and sub-category of a virtual offer.

In some example embodiments, the virtual offer builder 110 may beconfigured to construct one or more virtual offers. In some examples,every combination of virtual offers that may be constructed, as definedby a taxonomy model, is constructed. Alternatively or additionally, thevirtual offer generation module 202 may be configured to generatevirtual offers according to a set of guidelines or rules. The guidelinemay be operable to provide limitations on prices or price ranges thatone or more sub-sets of categories and/or sub-categories may be pairedwithin a virtual offer. For example, the virtual offer generation module202 may be configured to limit the generation of a first category and/orfirst sub-category to a first sub-set of price ranges. For example, avirtual offer comprising a category of “food and dining” and asub-category of “pizza” may be limited to prices and/or price rangesunder a predetermined limit, e.g., $100. Whereas a virtual offercomprising a category of “food and dining” and a sub-category of “finedining” may be limited to prices and/or price ranges over apredetermined limit, e.g., $50.

In another example embodiment, the limitations on the generation ofvirtual offers may be made according to prior performance of the virtualoffers at each of one or more prices or price ranges, prior performanceof certain categories and/or the like. Alternatively or additionally,the virtual offer generation module 202 may limit virtual offergeneration to a specific time period (e.g., “spring”, “February”, “next60 days”), a specific location and/or hyper-local region (e.g.,“Chicago” and/or “60602”). In further examples, the virtual offers maybe limited to categories and/or sub categories having merchants in agiven area.

In some example embodiments, the virtual offer generation module 202 mayprovide one or more generated virtual offers to the probabilitygeneration module 204. The probability generation module 204 may beconfigured to determine a probability that a particular consumer maypurchase a particular virtual offer. The probability generation module204 may be configured to access consumer data in a consumer database112. The consumer database 112 may comprise one or more users and userdata related to each of the one or more users that may be used tocalculate a probability that a particular user would buy a particularoffer in a particular time frame for at least a portion of the pluralityof users and for each of the virtual offers. In one example embodiment,the probability generation module 204 may determine a probability that afirst consumer, second customer, an n^(th) customer would buy a firstvirtual offer.

In some example embodiments, the probability generation module 204 mayfurther be configured to generate a ranked user list for each of the oneor more users comprising each of the one or more virtual offers and anassociated calculated probability. In some examples, the probabilitygeneration module 204 may be operable to cast a vote for a particularoffer. For example, a vote may be cast for the top t offers in theranked list. Alternatively or additionally, the vote value may beassigned based on the area in the ranked list and/or the like.

In some examples, a union of the top t offers for each user, the top xoffers based on votes or the like may be used to select demanded offersfrom the set of virtual offers. Given a specific list of demandedoffers, each of the demanded offers may be matched with a forecasteddemand (e.g., in terms of quantity of units, revenue or the like) byaggregating the probabilities that each of the users would purchase theoffer as output by the demand calculation engine 114. Alternatively oradditionally, the output may be ranked, prioritized, diversified, and/ortrimmed. In some example embodiments, a projected revenue value may becalculated for each virtual offer based on prior performance data perunit and an estimated number of units to be sold. Based on the revenuecalculation, the one or more virtual offers by the projected revenue.

The demand adjustment module 206 may be configured to input the list ofdemanded offers and provide one or more adjustments based on diversity,portfolio mix, price mix, hyper-local constraints, prior performance,context information or the like using a prior performance database 210,a historical contextual information 212. In some example embodiments,the demand adjustment module 206 may apply a diversity adjustment. Thediversity adjustment may comprise user-level diversity adjustment (e.g.,individual consumer probabilities are adjusted based on predeterminedconstraints, such as user may have a 40% “food and dining” maximum),aggregated output level (e.g., forecasted demand is adjusted topredetermined constraints, such as a maximum of 40% food and dining, 30%health and beauty and/or the like) and/or the like. Alternatively oradditionally, the adjustment may take into account a category mix, suchas by selecting a certain percentage of offers based on the ranked listaccording to a set percentage, a price mix or the like.

In some example embodiments, the demand adjustment module 206 may beconfigured to adjust the forecasted demand according to priorperformance. For example, specific offers may have outperformed orunderperformed calculated demand of a related virtual offer in a pastoffering, indicating that the demand for the related virtual offer maybe more accurately represented by a higher or lower demand. In suchcases, the demand adjustment module 206 may adjust the forecasted demandbased on the historic data.

In some example embodiments, the demand adjustment module 206 may beconfigured to adjust a demand of one or more virtual offers according tocontext information, such as seasonality, discrete weather events,economic conditions and/or other recurring events. For example, demandfor one or more categories or sub-categories may be adjusted accordingto seasonality or a specific season (e.g., adjust “ski” virtual offersupward in late fall or winter and adjust down in spring), rainfall(e.g., adjust “outdoor virtual offers during above average rainfallperiods) and/or the like. In some example embodiments, specific eventsmay cause adjustment (e.g., adjust “golf” virtual offers during timeperiods when golf events are happening, such as the U.S. Open and/or inlocations or hyper-local regions where golf events are taking place,such as Rochester, N.Y. during the PGA championship 2013).

The demand adjustment module 206 may therefore be configured to outputone or more virtual offers, each with a corresponding demand. Thecorresponding demand may include demand amounts that may have beenadjusted based on any one or more of the aforementioned factors. Thecorresponding demand may also include demand amounts that have notadjusted by any of the aforementioned factors. As such, the collectivedemand information output by probability generation module 204 isreferred to as forecasted demand herein.

Alternatively or additionally, demand may be forecasted using historicalconversion rates for each potential virtual offer and each knownconsumer, top categories or sub categories rank ordered by performancemetrics such as Engaged User Profit Per Thousand (ePPM) or the like,search engine data, use of a website that provides the one or moreoffers, subscription data, historical sales, sales in the market placeand/or the like. In some examples, offer related keywords on searchengines click through to an offer can be leveraged as a signal of demand(e.g., a model that translates or otherwise correlates searches tooffers sold). In some examples, the use of a website or mobileapplication that displays or otherwise advertises available offers maybe tracked as an exogenous source of demand and can be used inidentifying not only the current demand, but also for identifying highdemand offers that are not currently stocked. Each of these demandforecasting methods may be used in conjunction with each of the otherdemand forecasting methods as well as may be used alone.

Additionally or alternatively, in some example embodiments, with theintroduction of search and browse functionality and the capture of datatherefrom on a promotion and marketing service (e.g., as may be providedby the promotion system 1410 described later), demand may be inferredand a real time demand may be calculated. In some embodiments, a searchfeedback system may be configured to capture user search data. Forexample, modules allowing for a search volume and a search conversionrate may be included in a demand forecasting model (e.g., demand module102)

Additionally or alternatively, in some example embodiments, indetermination of whether a demand is fulfilled or in calculating what aminimum number of promotions are necessary to consider demand fulfilled,a fill rate may be calculated. Fill rate may be used to identify whethera demand for a particular promotion in a particular location is met byadding (1) a portion of inventory of the particular promotion in theparticular location and (2) a portion of an inventory of the particularpromotion or a related promotion whose effective location encompassesthe particular location.

Supply Identification

FIG. 2b shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with Supply ID module 104of process 100 that is configured to identify one or more merchants thatare able to provide goods, services or experiences to meet a forecasteddemand. In some example embodiments, the supply ID module 104 maycomprise a demand input module 220, a residual demand calculation module224, a sales value score calculation module 228, and/or a merchantprioritization module 238. Each block of the circuit diagram, andcombinations of blocks in the circuit diagram, may be implemented byspecial purpose hardware-based computer systems that perform thespecified functions or steps, or combinations of special purposehardware and computer instructions.

In some example embodiments, the demand input module 220 may beconfigured to receive a forecasted demand, which may be input from oneof the demand module 102, a demand database 222 and/or the like. Theforecasted demand may be one or more virtual offers and an associateddemanded quantity, a demand for one or more goods, services orexperiences and/or the like. In some examples, the associated demandedquantity may be in units, revenue, profits, or the like.

In some example embodiments, the residual demand calculation module 224may be configured to receive a forecasted demand that is input via thedemand input module 220 and calculate a residual demand by subtractingexisting inventory from the forecasted demand. In some exampleembodiments, only those offers in inventory matching each of thecategory, sub-category, location, and price or price range may besubtracted from the demand. Alternatively or additionally, predeterminedsubstitutions may be made (e.g., where one or more of category,sub-category, location, hyper-local region, and price range may bedifferent) and the predetermined substitutions may specify specificallowable substitution for particular categories, sub-categories,locations, hyper-local regions, and/or price ranges. In some examples,similar categories or sub-categories or any other facet of the virtualoffer may also reduce demand.

In some example embodiments, specific guidelines may be utilized indetermining which particular offers in a current inventory may beconsidered. In some example embodiments, when determining residualdemand, only those offers in current inventory that are available for anentire time frame of forecasted demand may be considered. For example,if a first virtual offer comprises a first demand where demand wascalculated for one month, only those offers in current inventoryavailable for the one month period are considered in calculating aresidual demand. Alternatively or additionally, when an offer is incurrent inventory, a determination may be made to calculate how manyunits of the offer are likely to be sold, using for example priorpurchase history, other historic data, current offers and/or the like,and only that number calculated may be utilized when calculatingresidual demand. For example, if 200 units of an offer featuring“personal training sessions” in a local area are available in localinventory, but based on prior purchase history, only 100 are determinedas likely to sell, residual demand may be calculated using the 100 unitslikely to sell instead of the 200 units in the current inventory.

In some example embodiments, penalties may be applied to offers incurrent inventory based on a time frame that they have been available orsitting in inventory. Penalties may also be applied based on priorexposure or seasonality also. For example, 400 units of offer for“American Food” with a sub-category “Burgers” may be in currentinventory. The 400 units may be utilized in calculating residual demand,or the 400 units may be discounted based on the time spent in inventory(e.g., 20% per 3 months), prior exposure (e.g., 20% discount for eachmonth it's been featured), and/or seasonality (20% discount in thesummer). After applying the penalties, less than the 400 available unitsmay be considered when calculating residual demand.

Alternatively or additionally, in some example embodiments, beforecalculating a residual demand based on current inventory, the merchantsin the current inventory are provided to the sales value scorecalculation module 228. In an instance in which a sales value score fora merchant satisfies a predetermined threshold or ranking, then theinventory provided by that merchant would be considered in calculatingresidual demand.

Using the residual demand, the supply ID module 104 is configured toassign each offer defined by the residual demand to one or moremerchants in an instance in which the merchant is able to provide goods,services and/or experiences as defined by the merchant demand. In someexamples, the one or more merchants may be determined based on a globallisting of merchants stored in a merchant database. As such, to theextent the merchant provides a good, service or experience that matchesor is related to a demanded offer, the demanded offer may be assigned orotherwise linked to that merchant. Each merchant may therefore beassigned zero or more demanded offers as defined by the residual demand.

In some example embodiments, a sales value score calculation module 228is configured to input the listing of merchants and then may calculateone or more scores related to a merchant. In some examples, the salesvalue calculation module may be configured to calculate a merchantquality score, a risk potential, a probability to close, a time to closeand/or the like. The sales value score calculation module 228 may alsobe configured to calculate one or more of a quality score, an expectedbooking amount, a risk potential, a time to close, or a probability toclose for one or more merchants. The sales value score calculationmodule 228 may utilize a quality score calculator 230 to calculate thequality score, an expecting booking calculator 232 to calculate theexpecting bookings, a time to close calculator 234 to calculate a timeto close, and a probability of close calculator 236 to calculate aprobability to close. The sales value score calculation module 228 maybe configured to access a merchant database, including one or morefactors related to one or more merchants in order to calculate the salesvalue score of a respective merchant.

In some examples, a merchant quality score indicates a predicative valuethat is indicative of how well a merchant would perform during an offerand how consumers would react to the offer. The merchant quality scoremay include factors such as reviews from a plurality of internet sites(e.g., Yelp®, etc.), likes (e.g., Facebook® likes), quality of website,prior offer performance(s), competitor offers, prior performance ofrelated merchants, and/or Hotspots. For example, a decision model may beused to generate a merchant quality score. As such, if a merchant has atleast an average of 3.0 stars over five reviews, then a merchant mayreceive a merchant quality score of between 6-10 depending on theoverall star average, number of reviews and social media like. In otherexamples, a merchant without 3.0 stars over five reviews may receive ahigh merchant quality score (e.g. 8) if that merchant has a large numberof likes, a positive review from a predetermined acceptable sourceand/or the like.

In some examples, a risk potential may indicate the risk that a merchantmay pose, such as to refund rate, complaints and/or the like. Riskpotential may be calculated based on the business type, credit score,age, capacity, judgments, Better Business Bureau rating, etc. RiskPotential may also predict a refund or return rate of a potentialmerchant offering. In one embodiment, providers may be classified as“good” providers defined as those likely to have return rates less thana predetermined amount (e.g., 10%) and “bad” providers defined as thoseproviders likely to have return rates greater than a predeterminedamount. In general, the process of classifying the providers may accessand/or capture internal, external and web data related to a providerincluding existing return rates. The data may then be normalized andsupplied to a classifying model as attribute data. The process may theninclude training the classifying model to recognize one or more patternsindicative of a return rate of a provider in accordance with theattribute data. When given a provider and corresponding attribute data,the process may then identify a class of the provider in accordance witha plurality of corresponding attribute data, wherein the identificationis determined based on one or more patterns determinative of a returnrate by the classifying model. The corresponding attribute data maycomprise one or more of category data, sub-category data, competitorfeature data, time data, financial stability risk data, median creditdata, count of judgment data, risk level data, or web data (e.g.,reviews, review scores, “likes” or the like).

The probability to close represents a probability of a merchantcommitting their inventory, such as signing a contract. Probability toclose and time to close may be based on in combination, but not limitedto, a lead source, such as for example a “warm lead” versus a “coldcall”, quality of the lead source, merchant attributes, stage of close,interface time, talk time, past feature history data, past featureperformance(s), high prior satisfaction, an upcoming expiration of anoffer, whether the merchant is a new or existing customer, and/orwhether the merchant has adopted other services. A probability to closeand/or a time to close may be calculated based on a logistic regressiontool, a model and/or the like. In one example, a probability to closeindicates the probability that a particular provider of the one or moreproviders will contract with a promotion service to offer a promotion,wherein the promotion is offered to a consumer for purchase from thepromotion service in exchange for an instrument. The time to close maybe calculated as a number of days from a current date, or date ofreceipt of the sales lead, for example

In one embodiment, in order to facilitate a calculation of a probabilityto close and/or a time to close, the promotional system may beconfigured to receive a sales lead comprising an indication of aprovider, and at least one of a provider category, a lead source, orhistorical data relating to the one or more providers as well asreceive, calculate or otherwise generate a series of metrics about aproviders, a good, a service, an experience, a category, a sub-category,a location, a time period and/or the like. A sales lead may, in someembodiments, be generated or received from a third party system or thelike. The sales lead may include any of a provider name, an individualcontact at the provider (e.g., manager), address, category and/orsubcategory of the provider and/or services offered by the provider(such as food and drink, or salon services) and/or the like.Additionally or alternatively, in some embodiments, the sales lead mayinclude information regarding a specific promotion with which to targetthe provider. As such, the sales lead may include a promotionspecifically designed for the provider, or a provider may bespecifically targeted to honor a preconceived promotion.

In some examples, the sales value score calculation module 228 maycalculate a prioritization score that is a function of one or more ofthe merchant quality score, the risk potential, a probability of closingand a time to close for each demanded offer. A sales value score maythen be calculated, which is a function of the prioritization score, anexpecting bookings amount and/or urgency. For example, a provider thatis identified as able to provide more bookings (e.g., meet more residualdemand), may have a higher sales value score than a second provider whoscores higher on prioritization.

In some example embodiments, a merchant prioritization module 238 may beconfigured to receive a listing of one or more merchants identified asable to meet a portion of the residual demand and a corresponding salesvalue score for each merchant from the sales value score calculationmodule 228.

In some example embodiments, the merchant prioritization module 238 maybe configured to receive one or more merchants, a corresponding salesvalue score and a list of each virtual offer that each of the merchantsis identified as able to meet at least a portion of the demand for andwhat portion. The merchant prioritization module 238 may be configuredto determine a priority of the one or more merchants. The one or moremerchants may then be rankable based on the priority score within aspecific virtual offer or by the sales value score given a list ofvirtual offers that may be fulfilled. In some example embodiments, themerchant prioritization module 238 may prioritize the merchants andapply an adjustment based on a portfolio score. The portfolio score maybe a diversity constraint from the portfolio mix generator 240. Themerchant prioritization module 238 may be configured to receive inputfrom or access the portfolio mix generator 240 regarding offerdiversity. Offer diversity may comprise a predetermined mix. Theportfolio score may give pre-determined weight to specific categories,sub-categories, locations, or price ranges based on one or morepredetermined business objectives. The sales value score calculationmodule 228 is therefore configured to output a ranked list of merchants.

Assignment

FIG. 2c shows a schematic block diagram of circuitry that can beincluded in a computing device in accordance with assignment module 106in process 100. The assignment module 106 may comprise a prioritizedmerchant input module 242, a lead assignment module 246, a prioritizedlist generation module 258, a feedback and/or an update module 270. Eachblock of the circuit diagrams, and combinations of blocks in the circuitdiagrams, may be implemented by special purpose hardware-based computersystems that perform the specified functions or steps, or combinationsof special purpose hardware and computer instructions.

In some example embodiments, the prioritized merchant input module 242may be configured to receive a prioritized or otherwise ranked listcomprising one or more merchants. The prioritized list may be receivedfrom a prioritized merchant database 244, the supply ID module 104and/or the like. The prioritized list may comprise the listing ofmerchants and one or more of a sales value score, a priority score, aquality score, a risk potential, an expected booking score, a time toclose score, a probability to close score, an expected revenue and/orthe like. The prioritized list may also comprise a list of each of oneor more virtual offers associated with one or more of the merchants.

In some example embodiments, the lead assignment module 246 may beconfigured to ingest the prioritized list and further may be configuredto access sales resource data (e.g., resources, capacity, efficiency, asales resource expertise score for at least one of: category,sub-category, or location, etc.) to assign the merchants to the salesresources. In some examples, the lead assignment module 246 may beconfigured to utilize a sales resource database 248 to access the salesresource data. Alternatively or additionally, the lead assignment module246 may also be configured to access information related to anassociated capacity 250, an associated experience 252, an associatedexpertise 254 and/or an associated merchant mix 256 of one or more salesresources.

In some example embodiments, the lead assignment module 246 may also beconfigured to assign one or more sales resources an assignmentprobability number, wherein an assignment probability number representsa probability that a sales resource will be randomly assigned to a nextmerchant in an assignment process. The assignment probability number maybe calculated or assigned based on at least one of the associatedcapacity, the associated experience, the associated expertise, theassociated merchant mix of a sales resource, or any combination thereof.As such, the lead assignment module 246 may assign merchants to salesresources based on a weighted random allocation, such as based anassignment probability number associated with each of one or more salesresources.

In some example embodiments, the lead assignment module 246 may beconfigured to adjust an assignment probability number based on theassociated capacity, the associated experience, the associatedexpertise, the associated merchant mix, the merchant, an offer or thelike. Alternatively or additionally, before an assignment is made and/orafter a merchant is assigned to a sales resource, the associatedcapacity, the associated experience, the associated expertise, and/orthe associated merchant mix of a sales resource may be updated,re-calculated, and/or re-assigned by the lead assignment module 246. Theassignment probability number may then also be updated, re-calculated,and/or re-assigned.

The lead assignment module 246 may also be configured to assign at leasta portion of the one or more merchants according to at least theassignment probability number of the one or more sales resources, thesales value of the one or more merchants and/or the like. As describedabove, after an assignment is made, the associated capacity, theassociated experience, the associated expertise, the associated merchantmix of a sales resource, and/or any combination thereof may be updated,re-calculated, and/or re-assigned. The assignment probability number maythen be updated, re-calculated, and/or re-assigned.

As such and by way of example, in some example embodiments, the leadassignment module 246 may be configured to assign a first merchant to afirst sales resource at random based on the assignment probability ofthe first sales resource, decrease the assignment probability number ofthe first sales resource and adjust the capacity of the first salesresource. In some example embodiments, after a first merchant isassigned to a first sales resource, a second merchant may need to beassigned. The lead assignment module 246 may be configured to assign asecond lead to a second sales resource based on the assignmentprobability number of the second sales resource. The lead assignmentmodule 246 may then decrease the assignment probability of the secondsales resource and adjust at least one of the associated capacity, theassociated experience, the associated expertise, the associated merchantmix of the second sales resource, or any combination thereof.

In some example embodiments, the lead assignment module 246 may beconfigured to adjust the assignment probability number of one or moresales resources based on a predetermined portfolio mix and/or assignedmerchants. For example, where a first sales resource is assigned a firstmerchant and the merchant is associated with an ability to supply aportion of a virtual offer in a first category and/or a firstsub-category, the assignment probability number of the first salesresource may be adjusted when an subsequent merchant is being assignedso as to keep the portfolio mix of the first sales resource compliantwith a predetermined portfolio mix. In some example embodiments, thelead assignment module 246 may be configured adjust the assignmentprobability number of one or more sales resources based on merchantrelationship information. For example, where a first sales resource hasprior experience with a first merchant, the assignment probabilitynumber may be adjusted based on the outcome of that experience (e.g.,upward if the experience was positive and downward if the experience wasnegative).

In some example embodiments, the prioritized list generation module 258may be configured to generate a prioritized call list for one or moresales resources. The prioritized call list of one or more merchants. Insome examples, a merchant is only assigned to a single sales resource.Alternatively or additionally, the prioritized list generation module258 may be configured to access and/or include, in the prioritized list,at least one of contact information 260, a specific offer (including oneor more of category, sub-category), quantity, price, and/or price range,a rating or bounty score, context or a reason for inclusion or anycombination thereof.

In some example embodiments, the prioritized list generation module 258may be configured to receive merchant information and/or inventoryinformation, and the prioritized call list may be updated based on themerchant information or inventory information. For example, in aninstance in which a sales resource contacts a merchant and learns thatthe contact person, the merchant hours, phone number or the like haschanged, the sales resource may update the information accordingly.

In some example embodiments, the prioritized list generation module 258may be configured to re-assign merchants according to predeterminedmetrics. For example, a merchant may be de-allocated from a first salesresources and re-assigned (1) if a sales resource has made no contactand/or has no activity with a merchant for a predetermined period oftime, the predetermined period of time may be based on merchantinformation such as lead source; (2) if a sales resource has made nocontact and/or made no activity within a predetermined period of timefrom a previous activity; and (3) if a sales resource has no tractionactivity (e.g., 5 minutes of contact) within a predetermined period oftime. A merchant may also be reassigned if a sales resource has notclosed a contract within a predetermined period of time, thepredetermined period of time based on a merchant ranking. A merchant mayalso be reassigned if a sales resource has closed a first contract, buthas not closed a second contract within a predetermined period of timefrom expiration, the predetermined period of time based on a merchantranking.

In some example embodiments, the feedback and update module 270 may beconfigured to receive feedback and/or updated information from the salesresources. The feedback and update module 270 may be configured toprovide that information to other sources. For example, when a contractis closed, information related to the process and/or the contractdetails may be provided to the inventory database 226, the merchantdatabase, the demand database 222, or any other information source.Specifically, for example, the feedback and update module 270 mayprovide a units value for a specific service related to an offer (e.g.,300 units for a category “massage”, sub-category “back”, location“28202”, and price range “$50-$75”) to the inventory database. Thefeedback and update module 270 may provide information related to time,a number of calls, a contact person or the like to the merchantdatabase, which may later be accessed in re-calculating, re-adjusting,or re-assigning a sales value score, a probability to close, a time toclose, or any combination thereof.

In some examples, the feedback and update module 270 module may beconfigured to track metrics that measure the overall improvement made inthe pipeline. Such metrics may include, but are not limited to purchaseorder fill rate, lead time for filing a purchase order, lead conversionrate, demand fulfillment error, demand forecast error, gross revenue,aggregate conversion rate, number of unique purchasers and/or the like.

Flowcharts

FIGS. 3, 4, 6B-6K, 7, 8, 10, 11, 12, and 13 illustrate exampleflowcharts of the example operations performed by a method, apparatusand computer program product in accordance with an embodiment of thepresent invention. It will be understood that each block of theflowcharts, and combinations of blocks in the flowcharts, may beimplemented by various means, such as hardware, firmware, processor,circuitry and/or other device associated with execution of softwareincluding one or more computer program instructions. For example, one ormore of the procedures described above may be embodied by computerprogram instructions. In this regard, the computer program instructionswhich embody the procedures described above may be stored by a memory1404 of an apparatus employing an embodiment of the present inventionand executed by a processor 1402 in the apparatus. As will beappreciated, any such computer program instructions may be loaded onto acomputer or other programmable apparatus (e.g., hardware) to produce amachine, such that the resulting computer or other programmableapparatus provides for implementation of the functions specified in theflowchart block(s). These computer program instructions may also bestored in a non-transitory computer-readable storage memory that maydirect a computer or other programmable apparatus to function in aparticular manner, such that the instructions stored in thecomputer-readable storage memory produce an article of manufacture, theexecution of which implements the function specified in the flowchartblock(s). The computer program instructions may also be loaded onto acomputer or other programmable apparatus to cause a series of operationsto be performed on the computer or other programmable apparatus toproduce a computer-implemented process such that the instructions whichexecute on the computer or other programmable apparatus provideoperations for implementing the functions specified in the flowchartblock(s). As such, the operations of FIGS. 3, 4, 6B-6K, 7, 8, 10, 11,12, and 13, when executed, convert a computer or processing circuitryinto a particular machine configured to perform an example embodiment ofthe present invention. Accordingly, the operations of FIGS. 3, 4, 6B-6K,7, 8, 10, 11, 12, and 13 define an algorithm for configuring a computeror processing to perform an example embodiment. In some cases, a generalpurpose computer may be provided with an instance of the processor whichperforms the algorithms of FIGS. 3, 4, 6B-6K, 7, 8, 10, 11, 12, and 13to transform the general purpose computer into a particular machineconfigured to perform an example embodiment.

Accordingly, blocks of the flowcharts support combinations of means forperforming the specified functions and combinations of operations forperforming the specified functions. It will also be understood that oneor more blocks of the flowcharts, and combinations of blocks in theflowcharts, can be implemented by special purpose hardware-basedcomputer systems which perform the specified functions, or combinationsof special purpose hardware and computer instructions.

In some embodiments, certain ones of the operations herein may bemodified or further amplified as described below. Moreover, in someembodiments additional optional operations may also be included. Itshould be appreciated that each of the modifications, optional additionsor amplifications below may be included with the operations above eitheralone or in combination with any others among the features describedherein.

Process for Sales Automation

FIG. 3 shows an example method, namely process 300, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2 a, 2 b, 2 c, and/or 14) to calculate aforecasted demand, identify new supply and prioritize and assign leads,in accordance with some embodiments discussed herein. As shown in block302 of FIG. 3, an apparatus, such as the promotional system 1410, mayinclude means, such as the demand module 102, the processor 1402, thecommunications interface 1406 or the like, for receiving virtual offerdata. For example, a virtual offer may include a category and/or aservice sub-category, (e.g., massage as a category and/or shouldermassage as a sub-category. The offer may further include a locationand/or a hyper-local region (e.g., a location of Chicago, Ill. and/orhyper-local region of Wrigleyville). The virtual offer may furtherinclude a type of offer (e.g., two for one). A virtual offer, in thecontext of the aforementioned example, may be an offer that isconstructed, for example, by a computer algorithm, but may not beoffered for sale by a seller nor offered to a consumer.

As shown in block 304 of FIG. 3, the promotional system 1410, mayinclude means, such as the demand module 102, the processor 1402 or thelike for calculating a forecasted demand. In general, a forecasteddemand, which may be referred alternatively as a demand forecast or aprojected demand, may be calculated by calculating a probability that aparticular user would buy a particular offer in a particular time framefor at least a portion of a plurality of users and for at least of aportion of one or more virtual offers. An estimated number of units tobe sold may then be determined, or projected, for at least a portion ofthe one or more virtual offers as a function of at least the probabilityassociated with each of the one or more virtual offers. The probabilitymay be based on associated consumer data related to, for example, atleast one of a location, a gender, prior purchase history,personalization signals, seasonality or any combination thereof and bysimulating a plurality of virtual offers in a plurality of hyper-localregions, using for example a virtual offer construction algorithm, andapplying the associated consumer data to the virtual offers. The output,forecasted demand, may comprise at least one or more virtual offers anda demanded quantity of at least a portion of the one or more virtualoffers.

As shown in block 306 of FIG. 3, the promotional system 1410, mayinclude means, such as the supply ID module 104, the processor 1402, thecommunications interface or the like for receiving or otherwiseaccessing inventory data. As shown in block 308 of FIG. 3, thepromotional system 1410 may include means, such as the supply ID module104, the processor 1402 or the like for adjusting the forecasted demandand/or calculating an adjusted demand or residual demand. An adjusteddemand is the forecasted demand adjusted based on external factors(e.g., seasonality etc.). In some examples, a residual demand is theforecasted demand reduced by current inventory; such as the inventoryreceived at block 406.

As shown in block 310 of FIG. 3, the promotional system 1410 may includemeans, such as the supply ID module 104, the processor 1402 or the likefor identifying one or more merchants. The one or more merchants aredetermined as able to supply a portion of the adjusted demand. Ingeneral, the merchants may include any potential source of an offer. Forexample, the one or more merchants may include new merchants identifiedby, for example, a web crawler, or, alternatively or additionally, mayinclude merchants with whom, contracts have been previously closed. Insome examples, the list of merchants may come from a database ofmerchants that is maintained for the purposes of sales leads.

As shown in block 312 of FIG. 3, the promotional system 1410 may includemeans, such as the supply ID module 104, the processor 1402 or the likefor prioritizing the one or more merchants. Prioritizing may be may beaccomplished based on a calculated determination, such as a sales valuescore and/or the like. The sales value score may be calculated for theone or more merchants and may be a function of at least one of: expectedbookings, a merchant quality score, a probability to close, a time toclose, and a merchant return rate. In one embodiment, for providers whohave offered promotions in the past, prior performance data may also beutilized. For example, total bookings, number of activations, refunds,customer satisfaction, or the like may be used.

As shown in block 314 of FIG. 3, the promotional system 1410 may includemeans, such as the assignment module 106, the processor 1402, or thelike for assigning the prioritized supply to sales resources. In someexamples, the promotional system 1410 may assign the one or moremerchants to one or more sales resources in accordance with at least thesales value score of the one or more merchants, a capacity of a salesresource, experience of a sales resource, expertise of a sales resourceor the like. As shown in block 316 of FIG. 3, the promotional system1410 may include means, such as the assignment module 106, the processor1402, or the like for providing prioritized lists that may include eachof one or more merchants from the prioritized merchants that wereassigned in block 314. The sales resource may be responsible forconverting one or more sources of the prioritized merchants toinventory. The prioritized list may be configured in such a way as toprovide a sales resource with one or more sources that may, for example,represent the highest earning potential. The earning potential may becalculated for the sales resource, the merchants, and/or the promotionalsystem 1410.

In some example embodiments, the prioritized list comprises contactinformation and a suggested offer including a service, a quantity and aprice. The prioritized list may also provide contact reason whichprovide context to make the sales resource more effective. For example,the prioritized list may provide a sales resource with a suggestedproduct/service and desired supply, a price range, and/or hyper-localregion (e.g., 550+ units/month from $26-$50 for seafood in Middlesex).Alternatively or additionally, the prioritized list may comprise arating or a bounty. The rating or bounty may be related to a reward orcompensation system which may provide incentive for the sales resourceto close a specific merchant.

In some example embodiments, the prioritized list is generated based onsales resource related data, such that each prioritized list may beunique to a specific sales resource. The one or more merchants may beallocated to resources identified as best equipped to close them. Forexample, important sources may be divided equally in order to ensureeach source is given priority by the assigned resource. In some exampleembodiments, particular sources may be allocated based on a relationshipstatus with a specific resource. In some example embodiments, sourcesmay be allocated based on an expertise of a resource. For example, aspecific sales representative may be identified as having a higher closerate for health and beauty as compared to other sales representatives.In some example embodiments, sources may be allocated based on capacityof the resource.

Further discussion related calculating a demand forecast, identifyingnew supply, and prioritizing and assigning leads can be found in U.S.Provisional Patent Application No. 61/730,046, titled “METHOD ANDAPPARATUS FOR MATCHING SUBSCRIBER DEMAND WITH MERCHANT/INVENTORY SUPPLY”filed on Nov. 26, 2012”, U.S. Provisional Patent Application No.61/682,762, filed Aug. 13, 2012, titled “UNIFIED PAYMENT AND RETURN ONINVESTMENT SYSTEM”, and U.S. Provisional patent application Ser. No.13/460,745, filed Apr. 30, 2012, titled “SALES ENHANCEMENT SYSTEM”, eachof which is hereby incorporated by reference.

Process for Forecasting Demand

FIG. 4 shows an example method, namely process 500, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2 a, and/or 14) to calculate a forecasteddemand, in accordance with some embodiments discussed herein. As shownin block 402 of FIG. 4, an apparatus, such as the promotional system1410, may include means, such as the demand module 102, the processor1402, the communications interface 1406 or the like, for receivingvirtual offer data and consumer data.

In some example embodiments, consumer data is stored in memory, such asmemory 1404, and the consumer data is accessed from memory (e.g., alocal memory, a remote memory or the like) by, for example, a demandmodule 102 or processor 1402. Consumer data may include, for example,age, gender, location, hyper-local region, and/or past purchase historyincluding specific offers, dates, cost expenditures, offer types, offerstructures, etc. Consumer data may be the accumulation of informationrelated to each of or some portion of a current subscriber database. Inanother embodiment consumer data may comprise income information. In oneembodiment, wherein income information may not be available, consumerdata may comprise predicted income information. Predicted incomeinformation may be a function of one or more of an age, gender,location, hyper-local region, and past purchase history.

As shown in block 404 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for calculating a probability that aconsumer would buy a virtual offer. In some examples, the consumer datamay be used as an input signal to a virtual offer generation system thatis configured to use the consumer data to model the likelihood that aconsumer would buy a particular virtual offer. For example, based oninformation such as demographic, area, historical stats, gender, incomeand/or the like, the model may output a probability that one or moreconsumer would purchase a particular virtual offer. In one embodiment,characteristics (e.g., mean or median income) of an area, demographic,or gender associated with a consumer may factor into the calculation ofthe probability that a consumer would buy a virtual offer. For example,if a consumer is associated with an area with a mean income of apredetermined threshold (e.g., $150,000), increased probabilities may becalculated for particular virtual offers related to particularcategories, sub-categories, or prices.

As shown in block 406 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for generating a ranked list for eachconsumer comprising each of one or more virtual offers and associatedprobability that the consumer would purchase the virtual offer. In someexamples and by using an example pivot table or the like, the list ofconsumers and their associated probabilities for each of the virtualoffers may be converted into a listing of virtual offers and relatedprobabilities for each consumer.

In one embodiment, a demand calculation engine 114 may be utilized forcalculating the probability a consumer would buy a virtual offer, asshown in block 404, and generating a ranked list as shown in step 406.FIG. 10 shows an exemplary process for generating a ranked list ofvirtual offers.

Further discussion may be found in U.S. patent application Ser. No.13/411,502, filed Mar. 2, 2012, titled “RELEVANCE SYSTEM FOR CONSUMERDEALS”, and U.S. Provisional Patent Application No. 61/730,046, titled“METHOD AND APPARATUS FOR MATCHING SUBSCRIBER DEMAND WITHMERCHANT/INVENTORY SUPPLY” filed on Nov. 26, 2012”, each of which isincorporated by reference in its entirety.

As shown in block 408 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for assigning voting values to one or morevirtual offers on one or more of the ranked lists generated in block506. In some example embodiments, a first voting value is assigned to apredetermined number of virtual offers. For example, a voting value of 1may be assigned to each of the top 5 virtual offers on each consumer'sranked list. In some example embodiments, a first voting value isassigned to a first virtual offer and a second voting value is assignedto a second virtual offer, e.g., a voting value of 1 is assigned to thevirtual offer with the highest probability and a voting value of 0.8 isassigned to the next highest. Alternatively or additionally, descendingvoting values may be assigned to each of a predetermined number ofvirtual offers, e.g., a voting value of 1 is assigned to the highest, avoting value of 0.8 to the second highest, a voting value of 0.6 to thethird highest, etc. In some example embodiments, assignment of votingvalues may be limited to a predetermined amount of any one of acategory, sub-category, location, hyper-local region or price range. Forexample, a voting value may only be assigned to a predetermined number(e.g., 2 virtual offers in “food and dining”).

As shown in block 410 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402,communications interface 1406 or the like, for aggregating the rankedlists for each consumer into a single list using the voting values. Forexample, the voting values that a first virtual offer received for eachconsumer are summed and the virtual offer is added to the single listwith summed number.

As shown in block 412 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for calculating projected sales data. Insome examples, the projected sales volume, revenue, profit, or the likemay be calculated based on a calculation of how many or much of avirtual offer will be sold to a subscriber base. In some examples, andas shown in block 414 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may be configured to rank the virtual offers by salesprojected sales data. In one example embodiment, projected sales datamay be calculated for each of one or more virtual offers on the singlelist, based on the summed voting values. For example, virtual offersappearing on a plurality of user lists are going to have a plurality ofvoting values that will be summed. The summed total of voting valuesthen may appear on the single list and the summed total may then be usedto calculate one or more of a projected sales volume, revenue, profit orthe like.

As shown in block 414 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for selecting virtual offers for inclusionin a forecasted demand according to the ranking and/or a predeterminedportfolio mix. As shown in block 416 of FIG. 4, an apparatus, such asthe promotional system 1410, may include means, such as the demandmodule 102, the processor 1402 or the like, for accessing externalfactor data and/or inventory data. For example, inventory data mayinclude information related to current and/or available inventory.Current and/or available inventory may include information related toclosed contracts, unprocessed offers, unsold inventory, and/or recurringinventory.

In some example embodiments, available inventory data may also includepotential offers related to merchants that are not currently undercontract, but there is a high probability that they could be undercontract based on a calculated probability to close. Probability toclose represents a probability of a merchant committing their inventory,such as signing a contract and maybe generated based on a regressionthat takes into account, but not limited to, a lead source, such as forexample a “warm lead” versus a “cold call”, quality of the lead source,merchant attributes, stage of close, interface time, talk time, pastfeature history data, past feature performance(s), high priorsatisfaction, an upcoming expiration of an offer, whether the merchantis a new or existing customer, and/or whether the merchant has adoptedother services. For example, a representative may have a higherprobability to close if the offer in question is the same or similar toa past offer offered by the merchant. In the aforementioned instance,the probability to close may be above a threshold and the offer may beincluded in the available inventory.

Further description related to current inventory is found in U.S. Ser.No. 13/460,745, filed Apr. 30, 2012, and titled “SALES ENHANCEMENTSYSTEM”, which is hereby incorporated by reference. Further descriptionrelated to recurring inventory is found in U.S. Ser. No. 61/639,067,filed Apr. 26, 2012 titled “DEAL METER”, which is hereby incorporated byreference.

External factor data may include similar data that may be used ingenerating a forecasted demand, including for example, past offerperformance data, internal signal data, and/or external signal data.Past offer performance data may include, but is not limited to, specificcategories and/or sub-category performance within a location and/orhyper-local region, as well as specific offer structure, offer type,and/or price range performance in one or more categories,sub-categories, locations, and/or hyper-local regions. Internal signalsmay include consumer, subscriber, and/or merchant feedback, such assurveys, velocity data related to specific transactions, consumer searchdata, and consumer click through data and/or the like. External signalsmay include third party search engine consumer search data, third partyclick through data, market data, consumer data, and/or merchanttransaction data. Market data may include predicted market conditions orthe like. Examples of predicted market condition information for a givenmarket may include predicted population growth, predicted income growth,predicted inflation and predicted promotion system growth in a givenlocation. The predicted market data may factor in demographic dataand/or socio-economic data.

As shown in block 420 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for calculating an adjusted forecasteddemand. In some examples, one or more adjustments based on offerdiversity, portfolio mix, price mix, hyper-local constraints, priorperformance, context information or the like may be made to theforecasted demand. For example, in an instance in which market data mayindicate income growth, aging population, or the like in a location orhyper-local region, forecasted demand for particular virtual offersassociated with corresponding income growth, aging or the like may beadjusted accordingly.

Further discussion related calculating offer diversity can be found inU.S. Ser. No. 61/709,623, filed Oct. 4, 2012, titled “MERCHANT SIDECROSS-CATEGORY DEAL DIVERSITY”, which is hereby incorporated byreference.

As shown in block 422 of FIG. 4, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for outputting a forecasted demand. In someexample embodiments, outputting of the adjusted forecasted demand mayinclude exporting the adjusted projected sales data to a spreadsheetdocument for display and organizing, storing the adjusted projectedsales data to a memory for archiving and/or sending the adjustedprojected sales data to a processor of the like for further use. Itshould be noted that even though the term “adjusted” is used, theforecasted demand may be equal to the adjusted forecasted demand and theprojected sales data may be equal to the adjusted projected sales dataif, for example, units of a specific offer are not available.

Forecasting Demand Using Search Feedback

In some embodiments, additionally or alternatively, a total demand maybe calculated using, in part, consumer activity (e.g., consumer searchdata or user search data) to identify, for example, additional salesthat may have occurred if adequate supply was available to purchase. Forexample, in an exemplary embodiment, consumer activity, such asperforming a search or browsing through the website/app, may be used toinfer an intent to buy a promotion if, for instance, an acceptablepromotion were found (e.g., available for purchase). In someembodiments, to do this, the consumer search data may be captured,parsed, and/or classified. For example, consumer search data may becaptured in the form of text, characters, or the like input by aconsumer or, in some examples, in the form of a browsing pattern.

Subsequently, in order to identify relevant promotions, it may be usefulto make a determination of the location (e.g., geographical area),merchant, and/or category of product, service, or experience to which arequested promotion may be associated with. As such, in someembodiments, one or more classifiers (e.g., one or more locationspecific classifiers, one or more category specific classifiers, one ormore merchant specific classifiers, or the like) may be queried, thequery result used to determine an association to one or more of alocation, category, or merchant of the consumer request (e.g., what typeof promotion is requested and a location where the promotion is to beredeemed). In some embodiments, each of one or more classifiers may be atrainable classifier adapted using a supervised learning method, eachclassifier may be associated with the particular location, category,merchant or the like and adapted based on a training data set.

In general, the consumer search data may be used to determine one ormore of a location (e.g., a city, neighborhood, zip code or the like)and/or a category of a product, service, or experience, a merchant, orthe like for a promotion or in the context of real time demand, anidentification pair.

FIG. 6A is a block diagram showing an exemplary search feedback systemfor receiving consumer search data and providing searched attributesassociated with a location (e.g., location specific data) and/or with acategory (e.g., category specific data). As described earlier, “searchedattributes” may be parts of a promotion to which the consumer searchdata is translated or converted to. For example, one or more of thelocation, category, or price range of a promotion tuple may be asearched attribute. In some embodiments, any particular characteristicor combination of characteristics may be captured, parsed and/orclassifieds (e.g., merchants, price points, price ranges, subdivisionsor the like). The depicted system 600 is configured to include aconsumer search aggregation module 602 disposed in communication with asearch system 626 and/or various client devices 624 a and 624 b, forexample, via a network. The depicted consumer search aggregation module602 may comprise a consumer search data receiver 604 configured toreceive consumer search data from the search system 626, a search datadatabase 606 configured to store the consumer search data, a consumeraggregation module 608 and a first database 610 for storing searchedattributes associated with a category, and a location aggregation module612 and a second database 614 configured to store searched attributesassociated with a location.

In some embodiments, consumer search data, such as in one exemplaryembodiment, searched attributes associated with a category and searchedattributes associated with a location, or in another exemplaryembodiment, a first classification and a second classification, may bestored in a single database, such as for example, search data database606. As such, as will be apparent to one of ordinary skill in the art inview of this disclosure, the depicted system may be configured toreceive consumer search data, aggregate the search data by both category(or sub-category) and location (or hyper-location), in some examples ina single database having appropriate tags, store searched attributesassociated with a category and a location, and provide the searchedattributes to a demand forecasting module 116. Further discussionregarding utilizing consumer search data in demand forecasting may befound in U.S. patent application Ser. No. 14/106,203, filed Dec. 13,2013, titled “METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FORPROVIDING A SEARCH FEEDBACK SYSTEM”, which is incorporated by referencein its entirety.

In some embodiments, the search system may be configured, for example,to receive consumer search data that is indicative of search performedby a consumer. The consumer search data may comprise, for example, oneor more search terms and, in some embodiments, at least one of aconsumer location or a consumer ID. In some embodiments, the searchsystem may be configured, for example, to receive selection criteria forone of category of promotions or promotion type, search a promotiondatabase for one or more results that match the selection criteria,arrange another of categories of promotions or promotion types based onthe selection criteria, and communicate the one or more results and thearranged another of categories of promotions or promotion types forselection. In U.S. patent application Ser. No. 13/842,379, filed Mar.15, 2013, titled “PULL-TYPE SEARCHING SYSTEM”, which is herebyincorporated by reference in its entirety, a promotion searching system,method and computer program product are provided for receiving consumersearch data and providing search results.

In some embodiments, the search data receiver 604 is configured toreceive explicit and implicit data, including, for example, consumerlogin information, client device ID and other data indicative of aparticular consumer or a particular hyper-location and provide such datato the search data database 606. For example, in some embodiments,consumer search data may be attached to or associated with a particularconsumer or consumer ID or the like, by utilizing a system for tracking,storing and retrieving consumer related data. In U.S. patent applicationSer. No. 14/039,473, filed Sep. 27, 2013, titled “METHOD, APPARATUS, ANDCOMPUTER PROGRAM PRODUCT FOR CONSUMER TRACKING”, which is herebyincorporated by reference in its entirety, a promotion searching system,method and computer program product are provided for identifying,tracking, storing and retrieving of consumer related data in order tomonitor or identify mobile application and web browser activity of aconsumer.

The demand forecasting module 616 may be configured to access or receivesearched attributes associated with a category and/or location andcalculate a probability that a particular user would buy a particularoffer in a particular time frame for at least a portion of the pluralityof users and for each of the virtual offers.

In some embodiments, the demand forecasting module 116 may comprise anadjustment module, which may be configured to provide one or moreadjustments based on the searched attributes, or in other embodiments,diversity, portfolio mix, price mix, hyper-local constraints, priorperformance, context information or the like using, for example, a priorperformance database and historical contextual information.

The demand forecasting module 616 may be configured to provide thecalculated demand to a system configured for enabling the prioritizationof promotions for sale to merchants and/or for offering to consumers. Assuch, the demanded promotions are generated and stored in a promotioninventory 620, and may then be offered back to the consumers via clientdevice 624 a. Client device 624 a may then submit a search for apromotion or the like to the search system 620.

Generating Demand Based on Real Time Demand and Predicted Demand

FIG. 6B shows an example method, namely process 650, that may beexecuted by an apparatus for generating demand based on real time demandand predicted demand. For example, as discussed above, consumer activitymay be used to determine a real time demand. Subsequently, in someembodiments, as will be discussed in more detail below, the real timedemand may be summed with a predicted demand to determine a totaldemand. Similar to FIG. 4, as shown in block 6110 of FIG. 6B, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, togenerate a virtual promotion. The virtual promotion may comprise acombination of a category or sub-category, a location, and a pricerange.

Subsequently, as shown in block 6120 of FIG. 6B, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to calculate aprobability that a particular consumer would buy the virtual offer in apredetermined time period. In some embodiments, the probability may begenerated at least based on historical data related to the particularconsumer and one or more related consumers. Once one or moreprobabilities are calculated, a predicted demand in, for example, units,may be calculated. As such, as shown in block 6130 of FIG. 6B, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, todetermine an estimated number of units to be sold for the virtual offeras a function of at least the probability, the estimated number of unitsrepresenting a predicted demand.

Independent, serially, or in parallel to blocks 6110-6130, a real timedemand may also be calculated. Thus, as shown in block 6140 of FIG. 6B,an apparatus, such as the promotional system 1410, may include means,such as the processor 1402, the communications interface 1406 or thelike, to calculate a real time demand. In some embodiments, the realtime demand may be generated based on a plurality of generatedidentification pairs for a predetermined time period. An identificationpair may comprise a first classification (e.g., a category) and a secondclassification (e.g., a location). Further details related to thecalculation of real time demand and the determination of each of theclassifiers are further described with reference to FIG. 6C.

Once a predicted demand has been calculated and a real time demand hasbeen calculated, the results of each may be summed to determine a totaldemand. Accordingly, as shown in block 6150 of FIG. 6B, an apparatus,such as the promotional system 1410, may include means, such as theprocessor 1402, the communications interface 1406 or the like, todetermine, using a processor, total demand by summing the predicteddemand and the real time demand.

With a total demand having been calculated, it may be helpful todistribute the total demand to, for example multiple hyper-locationsand/or multiple sub-categories. In other words, because some promotionsor virtual offers may be identified by or otherwise include high levellocations or categories (e.g., a location that includes sub-locations ora category that includes sub-categories), the total demand may bedistributed accordingly among the sub-locations (e.g., among the citiesin a state, neighborhoods in a zip code or the like) and/or among thesub-categories. Additionally or alternatively, the distribution amonghyper-locations and/or sub-categories may be performed on the real timedemand.

In some embodiments, the predicted demand may be sales velocity drivenand forecasted for all combinations of service, location, and pricerange, with some portion of services forecasted at the subdivision leveland some distance-independent services forecasted at a division level.The real time demand may be added to the predicted demand forecaststructure and distributed per a current distribution of units acrossprice points. Example demand adjustments (recent sales, recently closeddeals, actively purchased inventory) may then be applied. In someembodiments, the promotion and marketing system may then match theconsolidated demand forecast with a merchant inventory, apply metricssuch as sales value score, which may be a function of one or more of amerchant quality score, a merchant value score, a risk potential, aprobability to close and a time to close, and provide the highestscoring merchants to, for example, sales representatives. As such, insome embodiments, because for example, some promotions or virtual offersinclude similar locations and categories as others and only vary onprice, real time demand for one or more ‘identification pairs’ may bedistributed among two or more price points.

As such, as shown in block 6160 of FIG. 6B, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to distribute the realtime demand across one or more predetermined price points. As shown inblock 6170 of FIG. 6B, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to distribute the real time demand across aplurality of hyper-local regions in an instance in which the secondclassification comprises a region that contains two or more hyper-localregions. As shown in block 6180 of FIG. 6B, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to distribute the realtime demand across a plurality of sub-categories in an instance in whichthe first classification comprises a category that contains two or moresub-categories In some embodiments, the apparatus may be configured toaccess and/or consider historical data to determine a distributionacross a given range of categories or services. For example, theapparatus may receive 1,000 searches for ‘massage’ over particular timeperiod. A predetermined percentage of the real time demand subsequentlycalculated may be distributed to the identification pair comprising theprimary deal service (e.g., ‘massage—full body’ may be the primary PDSin the massage header). Furthermore, based on historical data, a secondpercentage of the real time demand may be distributed to one or moreadditional identification pairs (e.g., those comprising‘Massage—Swedish’, ‘Massage—Hot Stone’, etc.).

Furthermore, in some embodiments, the promotion and marketing system maybe configured to account for seasonality of services. For example, whileprior search volumes may typically be representative of future searchvolumes, seasonality of services may affect which (e.g., a predeterminedtime period) past search volume may affect particular future searchvolumes. For instance, a large proportion of searches in October werefor “Tour—Haunted House” may not be expected to indicate the same inNovember. An example seasonality matrix may be applied to appropriatelymeter the demand forecast for seasonal services

Utilizing Consumer Search Data for Generating Real Time Demand

As discussed earlier with reference to block 6140 of FIG. 6B, a realtime demand may be calculated using consumer activity (e.g., consumersearch data or user search data) to identify, for example, additionalsales that may have occurred if adequate supply was available topurchase. FIG. 6C shows an example method that may be executed by one ormore machines for utilizing consumer search data for generating a realtime demand indication. The following discussion provides an exampleembodiment where a real time demand may be determined by capturing usersearch data from, for example, user activity (e.g., user input dataentered into a search engine, user searches on website/app or bymonitoring browsing through a website/app).

As shown in block 6205 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to access user search data,the user search data generated by a user interacting with a promotionand marketing service to identify a requested promotion. User searchdata may be captured in the form of text and/or characters input by aconsumer or, in some examples, additionally or alternatively, in theform of a browsing pattern. In some examples, two primary pieces ofinformation may be received from each search, at varying levels ofspecificity: (1) where (e.g., a location) the user is looking for apromotion. This may be a division (Chicago), neighborhood (Wicker Park),specific zip code (60647), specific address, or the like; and (2) what(e.g., a category, sub-category, a service, an experience, a specificmerchant or the like) the user is looking for. In some embodiments, thismay be a category (“food”), subcategory (“restaurants”), service(“pizza”), or specific merchant (“lou malnati's”). In some embodiments,the information may be misspelled (“midevil times”) or not promotionrelated (“My Groupons”).

Subsequently, in some embodiments, the user search data may beclassified into a particular location or category of service, product,or experience in the taxonomy to be useful in approximating demand. Forexample, in an exemplary embodiment, the user search data or searchedattributes associated therewith, may be determined to be semanticallyrelated to a particular service if the service-specific classifiercorresponding to that service generates a positive output in response toinput of a data representative of the user search data. In someembodiments, each classifier is a trainable classifier that has beenadapted based on a training data set of exemplary data representingexemplary terms previously determined to be semantically related toparticular service categories.

Accordingly, as shown in block 6210 of FIG. 6C, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to determine, usinga processor, a first classification of the user search data by parsingthe user search data into one or more terms. As shown in block 6215 ofFIG. 6C, an apparatus, such as the promotional system 1410, may includemeans, such as the processor 1402, the communications interface 1406 orthe like, to apply one or more terms within the user search data to asearch index. In some embodiments, a first classification may beconfigured to generate a mapping from the one or more terms within theuser search data to at least one of a service or merchant.

In some examples, the classifiers may only cover a portion of searchesor user search data, whereas, remaining user search data may beirrelevant to one or both of the location, category, or merchantclassifiers. In some embodiments, the promotion and marketing system maybe configured to increase the accuracy of merchant search classificationby leveraging other external sources. For example, the classifier maycount a search for ‘Statesville’ as a service (e.g., a service relatedto ‘academic course’ due to there being several schools that match thesearch term ‘Statesville’), or because the top result on an externalsite or in an external database is for the Haunted House, thisinformation may be used for more accurate categorization of specificmerchant searches. In some embodiments, the promotion and marketingsystem may be configured for increasing accuracy merchant level searchclassification by using location and click data. For example, there aregeneric merchant names that could cover a variety of services (ex.‘Joe's’, ‘Pure’) that may be accurately pinned to the correct merchantwith location and click data

Accordingly, as shown in block 6220 of FIG. 6C, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to generate thetaxonomy search index, the taxonomy search index comprising a mapping ofone or more terms with at least one category or sub-category defined bya taxonomy. The generation and utilization of the taxonomy search indexis further described in reference to FIG. 6D. Additionally oralternatively, as shown in block 6225 of FIG. 6C, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to generate themerchant search index, the merchant search index comprising a mapping ofone or more terms to at least one merchant. Generation and utilizationof the merchant index is further described with reference to FIG. 6E.

In some embodiments, the user search data may be utilized to determine alocation, such as for example, a requested redemption location. As shownin block 6230 of FIG. 6C, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to determine, using the processor, a secondclassification of the user search data. In some embodiments, the secondclassification identifies a requested redemption location for therequested promotion. In some embodiments, location specific data may begenerated by extracting one or more searched attributes associated witha location from the consumer search data.

As shown in block 6235 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to generate an identificationpair for the search data that is representative of a promotion tuple,the identification pair comprising the first classification and thesecond classification. In some embodiments, an identification pair maycomprise a location and a category. In some embodiments, theidentification pair may be indicative of one or more promotions. Forexample, as described above, in some embodiments, the user search datamay be received and a category specific data and location specific datamay be extracted or otherwise identified.

In some embodiments, the apparatus may be configured to store dataindicative of the number of times a particular promotion or virtualoffer is requested or otherwise identified by user search data. Forexample, a running tally of searches that may be associated with one ormore particular promotions or identification pairs may be kept. In someembodiments, each search or each instance of received user search datamay be associated with one or more promotions, virtual offers,identification pairs, or the like. In some embodiments, depending on thecategory specific data (e.g., depending on the category, sub-category,service(s), merchant(s) or the like associated with the consumer searchdata), a particular location(s) or distance(s) may be implicated, thusforming relevant identification pairs. For example, some categories,sub-categories, services, and merchants implicate more or less locallocations (e.g., a division or zip code versus a neighborhood orstreet). For example, a search for ‘hot air balloons’ may be receivedwith a latitude and longitude pairing that may be reverse geocoded to alocation (e.g., a city, state, zip code) whereas if the search were for‘pizza’, a hyper-location (e.g., a particular neighborhood) may benecessary as pizza restaurants are much more ubiquitous than hot airballoon experiences.

As shown in block 6240 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to aggregate a plurality ofgenerated identification pairs for a predetermined time period. As shownin block 6245 of FIG. 6C, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to generate a real time demand indicationfor a geographic area by ranking the first classification of theplurality that have a second classification within the geographic area.As shown in block 6250 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to display the real timedemand indication.

As shown in block 6255 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to receive a latitudelongitude pair generated at the time the user search data is received.In other words, the user search data may be received with an associatedlatitude and longitude pair. This latitude longitude pair may then beused to determine a location and/or hyper location. Accordingly, asshown in block 6260 of FIG. 6C, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to assign a hyper locationregion based on the latitude longitude pair. In some embodiments, otherindicators, such as a zip code, IP address, location informationassociated with a user profile, or the like may be used for location.

In some embodiments, the apparatus may be further configured to receiveand/or identify division-level searches and/or distance independentsearches. For example, a portion or a percentage of searches may bedefault searches where the user does not change the location or divisionalready populated in, for example, the search “bar.” For example, whilethis could mean that a user in Chicago wants to actively search in theChicago-Downtown subdivision (zip code 60604), it may also mean thatthey are searching for services in the broader area (e.g., ‘Tour—HauntedHouse’ in the surrounding areas), or want to further filter after theirinitial search. In some embodiments, these searches may be assigned tothe division, and in other embodiments, the apparatus may disregard oreliminate default searches if they are replaced by a more specificgeographic search for the same term. In some examples, the apparatus mayrecord the distance of each result and each purchase in the searchrecord such that where to allocate the demand from division-levelsearches may be analyzed.

In some examples, distance independent services may include searches forservices that users are willing to travel for (e.g., skydiving, hauntedhouse) and may not mapped or associated with a hyper-location or asubdivision, but instead be applied to the overall division. Once theconsumer search data is received, demand may be calculated using ataxonomy that describes services offered by a promotion and marketingservice. An example current classifier may attempt to match the searchto a merchant name and extrapolate the primary service that the merchantoffers. Determination of a promotion area for one or more promotions isfurther described with reference to FIG. 6K.

The promotion and marketing system may be further configured to consideradditional context. In some examples, the promotion and marketing systemmay aggregate services of a searched merchant as part of the demand forthat service. In some embodiments, the promotion and marketing systemmay include merchant search data into a merchant quality score for thatspecific merchant. In some embodiments, searches for specific services,subcategories or categories (ex. ‘Food’, ‘Massage’) may be run through amerchant classifier and/or top level searches may be handled separatelyfrom specific merchant searches, such that consumer search data from toplevel searches may be distributed across one or more services belongingto that subcategory or category.

Generation of a Taxonomy Search Index and a Merchant Search Index

In some embodiments, each of the classifiers may be a trainableclassifier that is adapted using supervised learning or unsupervisedlearning. For example, in some embodiments, a separate binary classifiermay be trained for each of a plurality of locations, each of a pluralityof categories of products, services, experiences or the like, and eachof a plurality of merchants. Specifically, in some embodiments, positiveexamples for each classifier may be sampled from terms (e.g., from forexample, searched attributes) annotated as relevant to the location,category, or merchant associated with the classifier, including highlevel locations and categories and/or more specific locations andcategories, and in some embodiments, negative examples may be sampledfrom those terms annotated as relevant to the parent of the classifier'slocation or category but not relevant to the classifier's location orcategory. For example, when training a classifier for Austin, positiveexamples may be sampled from the terms annotated as relevant to Austin,East Austin, North Austin, Allandale, etc., and negative examples may besampled from the terms annotated as relevant to Texas but not Austin(including Houston, Dallas, etc.). Subsequently, when training aclassifier for North Austin, positive examples may be sampled from theterms annotated as relevant to North Austin, Allandale, etc., andnegative examples may be sampled from those terms relevant to Austin butnot North Austin (including East Austin, etc.).

Accordingly, FIGS. 6D and 6E show example methods that may be executedby one or more machines for utilizing a search index, and in particulara taxonomy search index to determine one or more services, products,experiences, or the like from the user search data, a merchant searchindex to determine a merchant, respectively, in accordance with someembodiments discussed herein. As shown in block 6310 of FIG. 6D, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, toinput a service corpus, the service corpus comprising one or more termsand one or more services defined by a taxonomy. In some embodiments, thecorpus may be related to categories, sub-categories, experiences or thelike.

As shown in block 6320 of FIG. 6D, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to analyze one or more clickevents in the promotion and marketing system. In some embodiments, theone or more click events may be received in response to displaying oneor more promotions that correspond to the one or more terms. In someembodiments, the one or more click events identify a selected promotion.

As shown in block 6330 of FIG. 6D, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to identify one or moreservices for the selected promotion. As shown in block 6340 of FIG. 6D,an apparatus, such as the promotional system 1410, may include means,such as the processor 1402, the communications interface 1406 or thelike, to generate a mapping between the one or more terms and the one ormore services. Additionally or alternatively, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to generate categoryspecific data from the user search data. In some embodiments, thecategory specific data may be generated by extracting one or moresearched attributes associated with at least one of a category, asub-category, a service, an experience, or a specific merchant from theuser search data.

Turning next to FIG. 6E, an example method is shown that may be executedby one or more machines for utilizing a search index, and in particulara merchant search index, in accordance with some embodiments discussedherein. As shown in block 6350 of FIG. 6E, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to input a merchantcorpus, the merchant corpus comprising one or more terms and one or moremerchants that are capable of offering at least one of goods, servicesor experiences.

As shown in block 6360 of FIG. 6E, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to analyze one or more clickevents in the promotion and marketing system, the one or more clickevents received in response to displaying one or more promotions thatcorrespond to the one or more terms, wherein the one or more clickevents identify a user selected promotion. As shown in block 6370 ofFIG. 6E, an apparatus, such as the promotional system 1410, may includemeans, such as the processor 1402, the communications interface 1406 orthe like, to identify one or more merchants that are offering theselected promotion. As shown in block 6380 of FIG. 6E, an apparatus,such as the promotional system 1410, may include means, such as theprocessor 1402, the communications interface 1406 or the like, togenerate a mapping between the one or more terms and the one or moremerchants.

Assigning a Hyper Location

FIG. 6F shows an example method that may be executed by one or moremachines for assigning a hyper location using the latitude longitudepair generated at the time of user search data, in accordance with someembodiments discussed herein. For example, the latitude and longitudepair may be reverse geocoded to a particular location. For example, thelatitude and longitude pair may be reverse geocoded to a zip code,which, in some embodiment, may then be assigned to a geographicsubdivision or hyper-location. Hyper-local subdivisions may be defined,in some examples, by locating commercial centers with a highconcentration of merchants and/or aggregating surrounding subscribers.Location specific data may include one or more of a state, a city, ametro area, a zip code, a specific street or address, a corner, etc.

Accordingly, as shown in block 6410 of FIG. 6F, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to receive alatitude longitude pair generated at the time of the user search data.As shown in block 6420 of FIG. 6F, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to compare the one or moreterms to a location index, wherein the location index is trained basedon one or more geographical identifiers of a geographic area. Forexample, similar to FIGS. 6D and 6E, the location index may be atrainable classifier that is adapted using supervised learning. Forexample, in some embodiments, a separate binary classifier may betrained for each of a plurality of locations.

Accordingly, as shown in block 6430 of FIG. 6F, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to determine thatat least one of the one or more terms contains a geographicalidentifier. Subsequently, as shown in block 6440 of FIG. 6F, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, toassign a hyper location region as the redemption location based on thegeographical identifier.

Modifying Real Time Demand

FIG. 6G shows an example method that may be executed by one or moremachines for modifying the real time demand in accordance with aconversion rate, in accordance with some embodiments discussed herein.In some examples, the demand prediction algorithm may use the same orsimilar signals as real time demand, thus, in some embodiments, doublecounting may be performed. As such, in some embodiments, double countingmay be avoided. Accordingly, in some embodiments, a benchmark conversionrate may be identified (e.g., the historical conversion rate in areaswith good supply). This may be calculated, for example, using apercentile, such as the 75th percentile conversion rate, of one or moresubdivisions in a peer group for each identification pair over, forexample, a predetermined period (e.g., a three month period).Alternatively, in some embodiments, a benchmark conversion rate may alsobe applied to the number of searches to yield the number of units thatmay have been purchased with adequate supply. Then, in some examples,the actual purchases may be subtracted to yield net additional demanddue to unfilled searches.

Accordingly, as shown in block 6450 of FIG. 6G, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to identify abenchmark conversion rate. The identification of the benchmarkconversion rate is further discussed with reference to FIG. 6H.Subsequently, as shown in block 6460 of FIG. 6G, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to compare the realtime demand to the benchmark conversion rate to set a modified real timedemand that identifies a quantity of units that would have beenpurchased had the units been available. For example, if a benchmarkconversion rate for, for example, conversions on searches for ‘pizza’convert at 5% in, for example, areas having an at least minimumthreshold of supply relative to the demand, and if there are 1000monthly ‘pizza’ searches in downtown San Francisco that convert at 3.5%,it may be estimated or determined that the net additional demand at1000*(5%−3.5%)=15 units. In other words, a benchmark conversion rate maybe selected by determining one or more other subdivisions in a givenpeer group and identifying at least one other subdivision with thehighest reasonable conversion. In some embodiments, identifying thesubdivision with the highest reasonable conversion comprises identifyinga subdivision with enough supply and searches to ensure the conversionrate is not an outlier. Further discussion of use of a benchmarkconversion rate is discussed below with reference to FIG. 6H.Additionally, the promotion and marketing system may further beconfigured to, as may be done with a sales velocity-based demandforecast, an exponential weighted moving average (EWMA) may be applied,in some examples, to the search volume to fill supply ahead of growingtrends and growth of search feedback, because, for example, a lag may bepresent due to the time a sales representative contacts a merchant towhen a deal closes.

As such, as shown in block 6470 of FIG. 6G, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to identify an actualpurchase quantity. As shown in block 6480 of FIG. 6G, an apparatus, suchas the promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to modify the realtime demand, wherein the real time demand is equal to the actualpurchase quantity subtracted from the modified real time demand.

Determining a Conversion Rate

FIG. 6H shows an example method that may be executed by one or moremachines for determining a benchmark conversion rate that considersfactors such as travel times, historical sales data, sales velocity andthe like to determine the likelihood a consumer will purchase aparticular promotion in a particular area. The benchmark conversion ratemay be used to set a conversion rate a promotion and marketing systemmay achieve for a given promotion should proper supply be stocked.

Accordingly, as shown in block 6510 of FIG. 6H, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to access usersearch data, the user search data generated by a user interacting with apromotion and marketing service to identify a requested promotion. Asshown in block 6520 of FIG. 6H, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to generate an identificationpair for the search data, the identification pair comprising anidentification of a promotion tuple and a location (e.g., a geographicsubdivision). As shown in block 6530 of FIG. 6H, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to generate asearch velocity based on the generated identification pairs.

As shown in block 6540 of FIG. 6H, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to access a conversion ratefor the promotion tuple in a plurality of other locations (e.g.,different geographic subdivisions). As shown in block 6550 of FIG. 6H,an apparatus, such as the promotional system 1410, may include means,such as the processor 1402, the communications interface 1406 or thelike, to setting a benchmark conversion rate for a promotion tuple. Insome embodiments, the benchmark conversion rate may correspond to theconversion rate of a subdivision of the plurality of subdivisions basedon the subdivision satisfying at least one of a search velocitythreshold, a prime merchant metric threshold or a conversion ratethreshold. In some embodiments, the benchmark conversion rate maycorrespond to the conversion rate of a subdivision of the plurality ofsubdivisions based on the subdivision satisfying an inventory threshold.For example, in some embodiments, the benchmark conversion rate maycorrespond to the conversion rate of a subdivision of the plurality ofsubdivisions based on the subdivision satisfying a prime merchant metricthreshold in order to determine whether any subdivision has at least onehigh quality merchant. Subsequently, in some embodiments, using theinformation, the apparatus may be configured to make a determinationabout whether the conversion rate may be improved and, additionally oralternatively by how much the conversion rate may be improved in thosesubdivisions meeting the prime merchant metric threshold.

As shown in block 6560 of FIG. 6H, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to identify one or moreproviders in the subdivision having the benchmark conversion rate. Asshown in block 6570 of FIG. 6H, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to transmit a classificationof the one or more providers to a lead generation module.

As shown in block 6580 of FIG. 6H, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to analyze a particularlocation (e.g., a subdivision). As shown in block 6590 of FIG. 6H, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, togenerate two or more regions within the subdivision based on one or moreof subscriber density or population density.

In some embodiments, the process described above with reference to FIG.6H may be utilized in a process for generating promotions for redemptionby consumers. Further discussion regarding generation of promotions forredemption by consumers may be found in U.S. patent application Ser. No.14/038,629, filed Sep. 26, 2013, titled “AUTOMATED DEAL GUIDE STRUCTUREIDENTIFICATION”, which is incorporated by reference in its entirety

Additionally or alternatively, in some embodiments, since inventory maybe sparse for many identification pairs, the identification pairs, asdiscussed above, comprising an identification of a promotion tuple and alocation (e.g., geographic subdivision), the promotion and marketingsystem may be configured for establishing a benchmark conversion ratefor each of one or more identification pairs to, for example, estimatethe conversion rate that may be achieved in a given identification pairif that identification pair were stocked with adequate supply. In someembodiments, the benchmark methodology for an identification pair mayuse the maximum conversion rate from one of two approaches: (a) averageconversion rate for the promotion tuple (or PDS) in peer group; or (b)75th percentile tuple of all conversion rates for the promotion tuple(or PDS) across all subdivisions in a Peer Group. For example, todetermine a benchmark conversion rate for {Pizza, City-West (Chicago)},in this embodiment, the promotion and marketing system may be configuredto consider the conversion rates for Pizza in all subdivisions for allother Group 1 cities, such as (New York, San Francisco, Los Angeles). Inone example, a certain benchmark conversion rate for pizza (e.g., 5%)may be selected across all Peer Group 1 subdivisions since it may be,for example, the 75th percentile conversion rate of all subdivisions inthat Peer Group and may be greater than the average conversion rate.

However, for an identification pair in which search data is sparse, the75th percentile may actually be low, and in those instances the methodmay select (a) as the benchmark conversion rate. In some examples, thereare two primary next steps for updating the benchmark conversion rateselection. The promotion and marketing system may be configured to (1)transition to using subdivision peer groups instead of division peergroups, for example, to better normalize for subdivisions that aresimilar to each other; and (2) update the benchmarking algorithm to seekidentification pairs that may have a given set of supply conditions(e.g., at least 1 TMC/Top Quintile MVR/9,10 Hero Score “high quality”merchant).

For illustrative purposes, the supply condition of one high qualitymerchant from above will be used. In some examples, the primary means toselect a benchmark would go from the “75th percentile of all conversionrates for a service across subdivisions in a peer group” to “theidentification pair closest to the 100th percentile with at least 1 highquality merchant and a minimum # of searches across peer groupsubdivisions”

For example, in the following exemplary embodiment, using the supplycondition as described above, the promotion and marketing system may beconfigured to select the 92nd percentile benchmark, an identificationpair that is closest to 100% and meets the inventory minimum.

The additional example of a minimum level of inventory in a givenidentification pair may also comprise a fallback method to handle groupsof subdivisions that have no identification pairs with the minimuminventory requirement. For example, if there aren't any identificationpairs that meet a predefined threshold, the promotion and marketingsystem may be configured to fall back geographically to includesubdivisions from the next lowest and highest peer groups.

Subdivision Conversion Rate Percentile # ‘A’ Merchants SD2 (LA) 0% 8% 0SD1 (NY) 0.5%   17% 0 SD1 (LA) 1% 25% 0 City-West (Chicago) 1.5%   33% 0SD2 (SF) 2% 42% 0 SD3 (SF) 2.5%   50% 1 SD2 (LA) 3% 58% 0 SD3 (LA) 4%67% 2 SD1 (Chicago) 5% 75% 0 SD1 (SF) 8% 83% 1 SD3 (NY) 18%  92% 1 SD2(NY) 90%  100% 0

The average search conversion rate per merchant at the benchmarkconversion rate may be used to assess how many units each merchant in agiven node will sell, and thus the number of merchants required to filla given node. For instance, in the above example, the benchmarksubdivision was selected as follows:

Subdivision Conversion Rate Percentile # ‘A’ Merchants SD3 (NY) 18% 92%1

If there were 3 merchants in this benchmark subdivision:

Merchant Class Searches Sales Conversion Rate Merchant 1 A 1000 130 13%Merchant 2 B 1000 40 4% Merchant 3 C 1000 10 1% Total 1000 180 18%Average Merchant 6% Conversion Rate

When this 6% conversion rate is applied to the following subdivision:

Sub- division Searches Unit Gap # of Merchants City-West 10000 10000 *18% (benchmark) − 800/(10000 * (Chicago) 10000 * 10% (actual) = 6%) =800/600 = Pizza 1800 − 1000 = 1.33 merchants = 800 units gap 2 merchantsto fill

Alternatively or additionally, the promotion and marketing system may beconfigured to utilize the 95th percentile search conversion rate ofmerchants in the subdivision peer group to assess how many units an Amerchant in a given node may sell, and thus the number of A merchantsrequired to fill a given node. In some embodiments, the median may beused to assess how many B Merchants would reach the benchmark and reporton both.

For instance, if the A Merchant conversion rate for Pizza in Peer Group1 was 15% and the B Merchant conversion rate is 5%:

Subdivision Searches Unit Gap # of Merchants City-West 10000 10000 * 18%800/10000 * 13%) = (Chicago) (benchmark) − 800/1300 = Pizza 10000 * 10%0.61 = (actual) = 1800 − 1 A Merchant 1000 = 800 OR units gap800/(10000 * 4%) = 800/400 = 2 = 2 B Merchants

Identifying Whether there Exists Sufficient Inventory to Meet Demand

In some embodiments, consumers may buy or be expected to buy an amountof existing inventory or supply from one or more different locationsbased on the fact that people may travel. As such, inventory from adifferent location may be factored into the demand calculation of aparticular location or sub-location. To avoid overstocking or at leastensure adequate stocking of promotions, the following process may beused to address the likelihood a consumer may travel for some promotiontypes. FIG. 6I illustrates an example method that may be executed by oneor more machines for identifying whether there is sufficient inventoryto meet existing demand.

As shown in block 6610 of FIG. 6I, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to identify a real timedemand for a promotion tuple at a geographic location.

As shown in block 6620 of FIG. 6I, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to determine, using aprocessor, a promotion radius for the promotion tuple.

As shown in block 6630 of FIG. 6I, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to identify one or morepromotions offered by a promotion and marketing service that comprise atleast the category and the price information of the promotion tuple.

As shown in block 6640 of FIG. 6I, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to determine a promotion areafor the one or more promotions. In some embodiments, the apparatus maybe configured to determine a geographic target, a zip code, or the like.

As shown in block 6650 of FIG. 6I, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to determine whether thetotal demand for the promotion tuple at the geographic location issatisfied. In some embodiments, the total demand may be satisfied in aninstance in which the geographic location is within the promotion areaor radius for the one or more promotions.

Determining a Promotion Area

FIG. 6J shows an example method that may be executed by one or moremachines for determining the promotion area for the one or morepromotions. As discussed above with reference to FIG. 6I, the totaldemand may be satisfied in an instance in which the geographic locationis within the promotion area for the one or more promotions. FIG. 6Jprovides determination of the promotion area.

While consumers are willing to travel, that willingness to travel is notunlimited. That is, a consumer may be willing to travel to some placesand not others. Accordingly, in order to avoid over-stocking inventory,demand that may be met with inventory within the limits of this travelmay, in some embodiments, be considered. The amount of inventory from asecond location that may be considered in whether demand is met a firstlocation may be determined by distance, direction, and/or a specificlocation. In other words, a consumer may be less and less likely totravel further and further for a promotion, may be more or less willingto travel in a particular direction, or may be more or less willing totravel to specific locations. As shown in block 6710 of FIG. 6J, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like, todetermine a travel probability that a consumer that is associated with afirst subdivision would travel to a second subdivision. In someembodiments, the first subdivision and/or the second subdivision may beidentified by zip codes, neighborhoods, counties, cities, or the like.In some embodiments, natural or artificial landmarks may separatesubdivisions and/or identify subdivision boundaries. As is discussedbelow in more detail, travel propensity may be category/service specific(e.g., people from the north suburbs may be willing to drive to the cityof Chicago for food & drink and activities but not anything else).

Additionally or alternatively, in some embodiments, a method fordetermining whether a demand is fulfilled with existing supply maycomprise determining an effective location for a promotion based onhistorical purchase data. In some embodiments, the effective location ofthe promotion may include one or more different locations from whichconsumers travel from to purchase the promotion. The determination mayfurther include identifying whether a demand for the promotion in aparticular location is met by adding (1) a portion of inventory of thepromotion in the particular location and (2) a portion of an inventoryof the promotion whose effective location encompasses or includes theparticular location associated with the promotion. Accordingly, anapparatus, such as the promotional system 1410, may include means, suchas the processor 1402, the communications interface 1406 or the like,for determining an effective location for a promotion based onhistorical purchase data. The effective location of the promotion mayinclude one or more different locations from which consumers travel fromto purchase the promotion (i.e., a promotion area).

As shown in block 6720 of FIG. 6J, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to compare the travelprobability to a predetermined threshold. A second subdivisionsatisfying the predetermined threshold may be considered travel worthy.As such, as shown in block 6730 of FIG. 6J, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to identify that thesecond subdivision is travel worthy in an instance in which the travelprobability satisfies the predetermined threshold.

As shown in block 6740 of FIG. 6J, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to identify that thepromotion geographic location is in the second subdivision. As shown inblock 6750 of FIG. 6J, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to determine whether the total demand forthe promotion tuple at the geographic location is satisfied. In someembodiments, the total demand may be satisfied in an instance in whichthe geographic location is within the promotion area for the one or morepromotions and the second subdivision is travel worthy. As shown inblock 6760 of FIG. 6J, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to adjust the total demand based on thetravel probability.

Additionally or alternatively, in some embodiments, the effectivelocation may include one or more of (1) distances and/or (2) directions,(3) a specific location or (4) a corresponding set of locations (e.g.,people in Newark may travel to Manhattan or Hoboken for pizza, peoplefrom Hoboken will travel to Manhattan but not Newark, people fromManhattan wouldn't travel to either).

In an example embodiment, the promotion and marketing system may beconfigured to determine the effective deal radius for each of one ormore promotion tuples or identification pairs. An effective deal radiusmay be the k^(th) percentile distance of users in the subdivision to thedeals within the identification pair, promotion tuple or promotion theypurchased. The parameter k can be set at, for example, 75% to start andtightened to, for example, 50% (median distance) if a stricterdefinition of fill-rate is desired, in some examples. The effective dealradius for each identification pair, promotion tuple or promotion may bedetermined using historical deal purchase data with the followingconsiderations, in some examples: (1) implement fallback to averageeffective deal radius within the division or peer group when sufficientdata is not available at an identification pair level; (2) outlierremoval—filtering out of hero deals from the above calculation to ensurethat the effective deal radius is not skewed by them.

Using this example, the fill-rate may be defined, in some examples, asfollows: For each identification pair, there must be active deals withinthe effective deal radius of that identification pair to consider thedemand filled. While this example approach takes into account thepropensity of users to travel, it does not consider the direction oftravel. For example, users in Schaumburg, Ill. might be willing totravel to Downtown Chicago for a particular promotion tuple but not toNaperville, Ill. even though Naperville, Ill. might be within theeffective deal radius for <Schaumburg, category, pds>. However,direction of travel may also be considered.

In some embodiments, for each identification pair, the apparatus may beconfigured for determining a set T of subdivisions that are consideredtravel-worthy. As such, in some embodiments, for each subdivision S in agiven division D, the promotion and marketing system may be configuredto determine p(N|S, category, pds), which may be defined as theprobability that a user in subdivision S will buy a promotion from amerchant in subdivision N in the given identification pair. Note that inthis embodiment, it is assumed here that p(S|S, category, pds)=1. Insome embodiments, p(S|S, category, pds) may be other values. Thepromotion and marketing system may be further configured to calculatethe set T as those subdivisions N from above where p(N|S, category, pds)is above a certain threshold.

Using one of the approaches described above, the fill-rate may bedefined as follows: For each identification pair, there must be activedeals within the travel-worthy subdivision set T for that tuple toconsider the demand filled. The promotion and marketing system may thenbe configured to determine the minimum number of promotions of aparticular identification pair required to consider the demandfulfilled. In some embodiments, the minimum number of promotionsrequired may be a function of the demand and the ability of theavailable promotions to satisfy that demand. For Example, consider thatthe demand for a particular identification pair is D units. This demandmay be filled by the promotions available in the current inventory orvia new promotions that will be closed. For promotions in the currentinventory, the promotion and marketing system may be configured tocalculate min(capacity, projected sales in the next month). Projectedsales in the next month may be calculated using historical salesvelocity of that promotion. For newly closed promotions, the promotionand marketing system may be configured to estimate the number of unitsof demand that can be fulfilled by the promotion based on historicalsales of promotions within the same identification pair that have thesame or similar (e.g., within a predefined threshold or within apredefined range) merchant quality score. The total projected demandfulfilled by current inventory and newly closed promotions must exceedthe demand to consider the demand filled.

In some embodiments, an example incremental value may be considered. Forexample, the incremental value of closing the (k+1)^(th) promotion insubdivision A versus the (l+1)^(th) deal in subdivision B may be animportant consideration given, for example, limited sales resourcesavailable to close new promotions.

In some embodiments, the promotion and marketing system may beconfigured to calculate an incremental value by determining theincremental bookings that a new promotion is projected to bring in basedon the demand it will fulfill and the price point. The next promotionmay be closed in the subdivision where the highest incremental bookingmay be realized. In some embodiments, the promotion and marketing systemmay be configured to factor in other considerations in determining theincremental value of a promotion, such as user search experience,reduction in the number of null searches, and/or improved userexperience due to deal depth.

In some embodiments, the promotion and marketing system may beconfigured to consider (1) Price band—demand and propensity to travelmight differ by price even within the same identification pair; (2)Avoid over-counting when considering how much of the demand for aparticular identification pair is fulfilled by a particular promotionsince that deal could fulfill multiple identification pair; and (3)Determining the number of merchants to prioritize based on theincremental value of each promotion.

Providing a Dashboard

FIG. 6K shows an example method that may be executed by one or moremachines for providing a dashboard that allows users to see availabledata and trends in that data, such as varying fill rates, current demandgaps and the like. FIG. 6L shows an exemplary screenshot of thedashboard, in accordance with some embodiments discussed herein.

As shown in block 6810 of FIG. 6K, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to determine a total demandfor one or more promotion tuples using, for example, the method shown inFIG. 6B. As shown in block 6820 of FIG. 6K, an apparatus, such as thepromotional system 1410, may include means, such as the processor 1402,the communications interface 1406 or the like, to identify a currentsupply, for example, using the method shown in FIG. 6I. In someembodiments, the current supply may be identified in an instance inwhich the current supply is usable to satisfy the total demand.

As shown in block 6830 of FIG. 6K, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to determine one or moredemand gaps based on a difference between the total demand and thecurrent supply. As shown in block 6840 of FIG. 6K, an apparatus, such asthe promotional system 1410, may include means, such as the processor1402, the communications interface 1406 or the like, to provide a firstview in a lead dashboard, the first view comprising at least one of atotal demand, current supply or one or more demand gaps. As shown inblock 6850 of FIG. 6K, an apparatus, such as the promotional system1410, may include means, such as the processor 1402, the communicationsinterface 1406 or the like, to receive a selection of one of a pluralityof granularities of either a location or category. As shown in block6860 of FIG. 6K, an apparatus, such as the promotional system 1410, mayinclude means, such as the processor 1402, the communications interface1406 or the like, to refine the first view into a second view. In someembodiments, the second view may comprise additional granularity of atleast one of a total demand, current supply or one or more demand gapswhen compared to the first view.

As shown in block 6870 of FIG. 6K, an apparatus, such as the promotionalsystem 1410, may include means, such as the processor 1402, thecommunications interface 1406 or the like, to provide one or more of (a)fill rate summary, (b) demand gaps, (c) supply data, or (d) lead datafor each of one or more categories or locations. As shown in block 6880of FIG. 6K, an apparatus, such as the promotional system 1410, mayinclude means, such as the processor 1402, the communications interface1406 or the like, to generate a fill rate based at least in part onhistorical sales data for a promotion tuple.

In some embodiments, the dashboard may create an interface allowingvarious people to view and/or utilize specific information consideringthe available data and trends in that data, such as varying levels oflocation and parts of the service hierarchy. For example, the dashboardmay be configured such that a user, such as a senior manager/executivemay identify the largest supply gaps across the country—cut by anycombination of category/header/PDS and country/division/subdivision foruse in implementing strategies to fill the largest gaps acrosscategories/geographies. In another example, the dashboard may beconfigured such that a user, such as a DSM or CP, may identify thelargest supply gaps for a market and the status of the accounts thatcould fulfill those gaps for use in following up with the salesrepresentatives that own those accounts. In another example, thedashboard may be configured such that a user, such as a member of asoftware development/Sales Ops team, may monitor and/or ensure thatquality merchants that could fulfill the largest supply gaps are gettingassigned out and ranked highly or that end-to-end QA on the algorithmmay be performed. In another example, the dashboard may be configuredsuch that a user, such as a member of merchant research, may identifyareas with the highest lead gap, so that more merchants may beidentified. In another example, the dashboard may be configured suchthat a user, such as a senior manager/executive, may understand thetrend of fill rates, demand, and search conversion for use inprioritizing and/or allocating resources among competing initiatives toproactively shape and optimize the marketplace.

In some embodiments, providing a dashboard for the use cases describedabove may include a method to compute and scale a fill rate metricacross multiple levels of geography and/or taxonomy. In some examples,the demand for a given identification pair may be estimated using searchdata, historical sales, and the probability of users from othersubdivisions to travel to that division, for that promotion (e.g.,product, service, or experience). Projected sales from existingpromotions of the identification pair may then be used to compute a fillrate for the pair as min (Projected Supply, Projected Demand)/ProjectedDemand, which may then be aggregated to any level of geography ortaxonomy.

In some embodiments, the dashboard may be configured to include theflexibility to cut the data across varying levels of granularity forboth geography and level of taxonomy, the ability to provide an end toend view of the Demand Gap→Deal Supply→Lead Supply chain, theintelligence to consistently point users towards the areas of greatestopportunity, the speed to quickly move from cut to cut as discoveriesare made. In some embodiments, the dashboard may comprise one or more ofat least four primary sections. For example, the dashboard may include(1) a map view to visualize the divisions/subdivisions of greatestopportunity and further filter the existing data; (2) Fill Rate Summaryto understand the trend of fill rate from week to week; (3) Demand GapData to provide information on the identification pairs with the highestopportunity; (4) Supply Data to provide information on the existingdeals that satisfy the projected pull demand; and (5) Lead Data toprovide information on the merchants we could close to fulfill thedemand.

As such, a method may be provided comprising providing at least one of afirst view configured to indicate a difference between demand andsupply. In some embodiments, providing the first view may comprisereceiving a selection of one of a plurality of granularities of either alocation or category, accessing a corresponding demand and acorresponding supply, displaying an indication of the difference betweenthe corresponding demand and the corresponding supply. (e.g., looking atmap of Chicago, the neighborhoods may be colored based on gap size; orlooking at looking at hierarchal structure of food and dining,sub-categories colored based on gap sizes).

In some embodiments, the first view comprises a map view. In someembodiments, the providing of the first view further may comprise,preceding the reception of a selection of a location granularity,displaying a first map view, and allowing selection of a selection of afurther granularity.

In some embodiments, the method may further comprise providing one ormore of (a) fill rate summary, (b) demand gaps, (c) supply data, or (d)lead data for each of one or more categories or locations. Providing thefill rate summary may comprise accessing a plurality of demands over apredetermined time period at predetermined interval (e.g., weekly forthe last 8 weeks) and corresponding supply data, displaying anindication of the difference between the corresponding demand and thecorresponding supply data over the predetermined time period. Providingthe supply data comprises providing an indication of an amount ofexisting supply from one or more locations that satisfies demand. (e.g.,it may helpful to see if demand is being satisfied by supply from otherlocations). Providing demand gaps comprises providing informationrelated to unmet demand for one or more location and category pairs

In some embodiments, the dashboard may comprise one or more of a demand,supply and leads section. Each section may be configured to provide oneor more of summary statistics and/or a ranked and exportable list of oneor more of Demand Gap information, promotion and/or supply information,and lead information. For example, demand gap information may include(1) summary metrics, such as a total demand, total supply, total gap;and/or (2) an exportable list, such as demand gap pairs sorted by totalunit gap. Demand gap information may include one or more of thefollowing fields: a subdivision, primary deal service (e.g., a category,sub-category, service, or experience), projected demand, projectedsupply, and projected gap. With demand gap information, additionalfunctionality may be included, such as, for example, because the demandgaps may be a primary driver of insight, the demand gap information maybe displayed anywhere on the dashboard, (e.g., a prominent place withinthe dashboard) and/or also function as a filter for both geography andtaxonomy.

In some embodiments, the supply information may include (1) summarymetrics, such as total promotions, total projected units; and/or (2) anexportable list (e.g., deals sorted by total forecasted sales); Supplyinformation may include one or more of the following example fields: ID,merchant name, subdivision, and projected units. In some embodiments,lead information may include (1) summary metrics such as total leads,total owned leads, total approved leads, estimated lead gap; and/or (2)an exportable list that includes for example, leads sorted by salesvalue. Lead information may include one or more of the followingexemplary fields: an account ID, account owner, merchant status, lastcontacted date, sales value.

Process for Supply Identification

FIG. 7 shows an example method, namely process 700, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2, and/or 3) to identify merchants, inaccordance with some embodiments discussed herein. As shown in block 702of FIG. 7, an apparatus, such as the promotional system 1410, mayinclude means, such as the supply ID module 104, the processor 1402, thecommunications interface 1406 or the like, for receiving a forecasteddemand.

As shown in block 704 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402, the communications interface 1406 or the like foraccessing current offer inventory. As shown in block 706 of FIG. 7, anapparatus, such as the promotional system 1410, may include means, suchas the supply ID module 104, the processor 1402, or the like forcalculating a residual forecasted demand. In some example embodiments,the residual demand calculation module 224 may be configured to receivea forecasted demand that is input via the demand input module 220 andcalculate a residual demand by subtracting existing inventory from theforecasted demand. In one embodiment, existing inventory may be at leastone of inventory related to offers closed within a predetermined timeperiod (e.g., one day prior), offers closed within a secondpredetermined time period (e.g., one month), existing offer inventoryadjusted for quality, which is described below, and recurring inventory.In some example embodiments, only those offers in inventory matchingeach of the category, sub-category, location, and price or price rangemay be subtracted from the demand. Alternatively or additionally,predetermined substitutions may be made (e.g., where one or more ofcategory, sub-category, location, hyper-local region, and price rangemay be different) and the predetermined substitutions may specifyspecific allowable substitution for particular categories,sub-categories, locations, hyper-local regions, and/or price ranges. Insome examples, similar categories or sub-categories or any other facetof the virtual offer may also reduce demand.

In some example embodiments, specific guidelines may be utilized indetermining which particular offers in a current inventory may beconsidered. In some example embodiments, when determining residualdemand, only those offers in current inventory that are available for anentire time frame the forecasted demand was calculated for may beconsidered. For example, in an instance in which a first virtual offercomprises a first demand and the first demand was calculated forspecific time frame, such as for example one month, only those offers incurrent inventory available for the entire specific time period, e.g.,one month, are considered in calculating a residual demand.Alternatively or additionally, when an offer is in current inventory, adetermination may be made to calculate how many units of the offer arelikely to be sold, using for example prior purchase history, otherhistoric data, current offers and/or the like, and only that numbercalculated may be utilized when calculating residual demand. Forexample, if 200 units of an offer featuring “personal training sessions”in a local area are available in local inventory, but based on priorpurchase history, only 100 are determined as likely to sell, residualdemand may be calculated using the 100 units likely to sell instead ofthe 200 units in the current inventory.

In one embodiment, a dynamic deal optimization (DDO) score may becalculated. In order to facilitate calculation of a DDO score, theapparatus may be configured to access data related to a limitedperformance of an offer. The limited performance may be comprised ofperformance related to a limited sub-set of consumers. The limitedsub-set of consumers may be for example 30,000 out of 1,000,000. Thelimited sub-set of consumers may be distributed in a predeterminedfashion among consumers based on age, gender, location, hyper-localregion, or the like. The apparatus may then be configured to access,calculate, and/or determine a conversion rate among a cross section ofthe limited sub-set of consumers. For example, a conversion rate may becalculated for females. Additionally or alternatively, a conversion ratemay be calculated for one or more cross sections, such as for example,males between 22-30 years of age. Based on the conversion rate, thepromotions may be offered to more of particular consumers. The apparatusmay further be configured to calculate a portion of existing inventorythat may be applied to demand in order to calculate residual demandbased on a conversion rate. In one embodiment, the apparatus isconfigured to calculate a projected amount of the existing inventorythat may sell based on the conversion rate and utilize the projectedamount in a residual demand calculation.

In some example embodiments, penalties may be applied to offers incurrent inventory based on a time frame that they have been available orsitting in inventory. Penalties may also be applied based on priorexposure or seasonality also. For example, 400 units of offer for“American Food” with a sub-category “Burgers” may be in currentinventory. The 400 units may be utilized in calculating residual demand,or the 400 units may be discounted based on the time spent in inventory(e.g., 20% per 3 months), prior exposure (e.g., 20% discount for eachmonth it's been featured), and/or seasonality (20% discount in thesummer). After applying the penalties, less than the 400 available unitsmay be considered when calculating residual demand.

Alternatively or additionally, in some example embodiments, beforecalculating a residual demand based on current inventory, the merchantsin the current inventory are provided to the sales value scorecalculation module 228. In an instance in which a sales value score fora merchant satisfies a predetermined threshold or ranking, then theinventory provided by that merchant would be considered in calculatingresidual demand. In another example embodiment, in an instance in whicha sales value score for a merchant does not meet a predeterminedthreshold or ranking, the inventory provided by that merchant would notbe considered in calculating residual demand.

As shown in block 708 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402, the communications interface 1406 or the like foraccessing a merchant database. As shown in block 710 of FIG. 7, anapparatus, such as the promotional system 1410, may include means, suchas the supply ID module 104, the processor 1402, or the like foridentifying merchants to fill the residual demand. In an instance inwhich the merchant is able to provide good, services and/or experiencesas defined by the merchant demand, the merchant may be identified asable to fill the residual demand. In some examples, the one or moremerchants may be determined based on a global listing of merchantsstored in a merchant database. As such, to the extent the merchantprovides a good, service or experience that matches or is related to ademanded offer, the demanded offer may be assigned or otherwise linkedto that merchant. Each merchant may therefore be assigned zero or moredemanded offers as defined by the residual demand.

In one embodiment, an apparatus, such as the promotional system 1410,may be configured to identify new and/or additional goods, services,and/or experiences a merchant may provide. The apparatus may beconfigured, for example, to identify a merchant website, a reviewweb-site, and/or a good, service or experience specific website, anddetermine, from data found on the website, one or more new or additionalgood, services, and/or experiences a merchant may provide. For example,a hotel may be identified to be able to fill a portion of demand relatedto “travel and tourism” or the like. The apparatus may then identifywebsites that identify the hotel as a subject, such as for example thehotel's website, a review website, a review website related to travel,tourism or hotels, or the like. The apparatus may then identifyinformation on the website related to other services, goods, orexperiences the hotel may be able to provide. For example, the hotel'swebsite may provide information for breakfast, dinner and/or drinks or areview website may include a review about a spa service offered by thehotel. In one embodiment, additional virtual offers may be associatedwith a merchant where new or additional goods, services, and/orexperiences are identified. In another embodiment, information relatingnew or additional goods, services, and/or experiences identified as ableto be provided by a particular merchant may be stored in the merchantdatabase.

As shown in block 712 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a sales value score for oneor more merchants. The sales value score may be a function of one ormore of a merchant quality score, a merchant value score, a riskpotential, a probability to close and a time to close, each discussed inmore detail below. In some example embodiments, a sales value score maybe calculated using a research ranking, current stage in the salesfunnel, the source of the merchant, category information, locationinformation, what, if any, historical relationship each merchant haswith the promotional system 1410, or any combination thereof. In oneembodiment, for providers who have offered promotions in the past, priorperformance data may also be utilized. For example, total bookings,number of activations, refunds, customer satisfaction, or the like maybe used.

In some example embodiments, one or more of a merchant value, a merchantquality score, a risk potential, a probability to close and a time toclose are used to calculate a prioritization score. The prioritizationscore is then used, along with demand information, such as a number ofunits of a virtual offer and expected revenue to compute the sales valuescore.

As shown in block 714 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a merchant value. Themerchant value may be calculated by estimating a value of a next offerthe merchant may offer, a chance of working with the merchant (e.g.,probability of closing), a value of future offers with the merchant(e.g., all offers in next month, 6 month, year or the like), the chanceof closing one or more of the future offers, a merchant goodwill score,a relationship cost, and an ongoing value. The merchant goodwill scoremay represent a “wow” factor and may be calculated as a function ofconsumer's reaction to offering a service. This factor may be measuredby, for example, likes, reviews above a predetermined threshold on anyone or more of review websites. The merchant goodwill score,alternatively or additionally may represent a value of futurerecommendation from the merchant, which may be generated through forexample, word of mouth, direct relationships, and/or via leveraging therelationship to approach and/or close other merchants. One exampleformula that may be utilized in calculating a merchant value may beMerchant Value=(probability of closing merchant)*(Value of nextoffer)+(probability of closing subsequent offers)*(Value of subsequentoffers)+mechant_goodwill+ongoing_value−relationship_cost

As mentioned above, merchant value may be a function of an offer value.In some example embodiments, offer value may indicate or be a functionof one or more of profit, discounts used, number of activated consumers,number of re-activated consumers, refunds, engagement value, netgoodwill.

The engagement value may be a value that can be associated to users who(1) click on an offer from a particular merchant, (2) visit an offerpage and don't purchase, (3) search for the offer, (3) tell theirfriends about the promotion system, (5) “like” the offer on socialmedia. Net goodwill may be indicative of (1) good experiences and/or (2)bad experiences. One example formula that may be utilized in calculatingan offer value is:Offer Value=profit−discounts+#activations*activation value+#ofreactivations*reactivation value−refunds+engagement_value+net_goodwill

In one example embodiment, offer value may be relative to a quantitysold, units sold to new consumers, units refunded and/or the like.

As shown in block 716 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a merchant quality score. Insome example embodiments the merchant quality score is generated basedon a predicted value of how well (e.g. revenue, new business, etc.) amerchant will do on an offer and the customer reaction (e.g. based onhistorical data, similar results, demand etc.) to the particular offer.FIG. 11 shows an example method that may be used to calculate a merchantquality score.

As shown in block 718 of FIG. 7A, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a risk potential. Riskpotential may be calculated based on a merchant return rate. Forexample, if a merchant return rate is 10%, the risk potential may becalculated to be greater than a merchant with a return rate of 2%.

As shown in block 720 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a probability to close. Insome example embodiments, probability to close may be calculated as afunction of (1) stage in sales pipeline, e.g., not wanted, unknown,uncontacted, contacted, negotiating, contract sent, closed; (2) sourceof merchant, e.g., cold call, web to lead, other; (3) history e.g., rana promotion, ran a feature using a different promotional system, has notrun; (4) category; (5) sub-category; or some combination thereof.Probability to close may be calculated based on a particular time window(i.e. 30 days or 60 days). In some example embodiments, probability toclose may be calculated using a mathematical tool, such as a logisticalregression model.

As shown in block 722 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for calculating a time to close. In someexample embodiments, time to close may be a function of (1) the averagetime to close for each of a plurality of stages of a sales pipeline; (2)stage in sales pipeline, e.g., not wanted, unknown, un-contacted,contacted, negotiating, contract sent, closed; (3) source of merchant,e.g., cold call, web to lead, other; (4) history e.g., ran a promotion,ran a feature using a different promotional system, has not run; (5)category; (6) sub-category; or some combination thereof. Alternativelyor additionally, time to close may be calculated under the assumptionthat the merchant will be closed. In some example embodiments, time toclose may be calculated using a mathematical tool, such as a logisticalregression model.

Alternatively or additionally, business rules may be configured tooverride or otherwise adjust a merchant score. Business rules include,but are not limited to, does the merchant have an expiring offer (e.g.call regarding a re-feature), any contact from the merchant, did themerchant recently start an offer, is the merchant running offers in themarket, is the merchant on a targeted list, is the merchant a formermerchant, is the merchant on another list that is indicative of apositive or negative and/or the like. In some cases the business rulesmay be set based on a desire to attract new business, attract newconsumers, increase margin, increase portfolio diversity and/or thelike.

As shown in block 724 of FIG. 7, an apparatus, such as the promotionalsystem 1410, may include means, such as the supply ID module 104, theprocessor 1402 or the like for prioritizing merchants. In some exampleembodiments, the one or more merchants may be prioritized by salesvalues score. As shown in block 726 of FIG. 7, an apparatus, such as thepromotional system 1410, may include means, such as the supply ID module104, the processor 1402 or the like for outputting a list of prioritizedmerchants. In some example embodiments, the supply ID module 104transmits prioritization data to the assignment module 106.Alternatively or additionally, outputting of the merchant prioritizationinformation may include exporting the data to a spreadsheet document fordisplay and organizing, storing the data to a memory for archivingand/or sending the data to a processor of the like for further use.

Process for Lead Assignment

FIG. 8 shows an example method, namely process 800, that may be executedby one or more machines (some examples of which are discussed inconnection with FIGS. 1, 2, and/or 3) to assign leads, in accordancewith some embodiments discussed herein. In some example embodiments,leads are programmatically assigned so as to eliminate subjectivity andfavoritism from the allocation process, reduce attrition, maintainestablished relationships between resources and merchants they have madecontact with, properly plan for the capacity of each resource tomaximize sales value, provide leads to resource best suited to closethem (e.g., using specialization and capacity), continually grow eachresource book of business and/or the like. In some example embodiments,sales resources may be provided a target that may be based on the % ofthat division's assets (accounts) that they own and a target for newleads. In another example embodiment, sales resources may be provided atarget that may be based on the number of bounties to be collected byacquiring inventory from one or more marked. As such, a basic portfoliofor a rep may include a number of merchants, based on an average of repsthat a particular resource may handle, a set of new merchants, aportfolio mix of different categories, sub-categories or the like. Insome examples, a new resource may be issued a set new resource basket.

As shown in block 802 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402, the communications interface 1406 or the like forreceiving prioritized merchant data. In some example embodiments, thelead assignment process 800 may receive one or more leads.

As shown in block 804 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402, the communications interface 1406 or the like forreceiving sales resource data. For example, process 800 may receiveinformation related to salespersons responsible for closing contractswith merchants that offer services that fulfill at least a portion ofthe forecasted demand.

As shown in block 808 of FIG. 8 an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402 or the like for identifying capacity. In one embodiment,in order to facilitate the capacity calculation, the average number ofunique providers contacted per “normal” day over a period of, forexample two weeks, may be calculated and outliers may be excluded. TheLead Assignment module may place the highest value leads as high on asales rep's list as possible relative to the number of unique merchantcontacts they make, thus minimizing time to contact for the highestvalue leads. In some example embodiments, the promotional system 1410 isconfigured to identify or access data indicating a capacity of one ormore sales resources. In one embodiment, the promotional system 1410 maybe configured to track and/or store information related to each contacta sales resources makes or attempts to make (e.g., a phone call oremail). The promotional system 1410 may also be configured to calculatesales resource activity data. For example, the promotional system 1410may calculate a number of providers contacted per time period (e.g., 8hours, day week or the like). The promotional system 1410 may also beconfigured to calculate, store, or track a moving average (e.g., a 10day moving average) of number of providers contacted per predeterminedtime period. Additionally or alternatively, each of one or more salesresources may have a target number of providers to contact perpredetermined time period that may be based on the type of salesresource (e.g., a sales representative, an email marketing system or thelike). The promotional system 1410 may be configured to calculate,store, or track a number of providers contacted, a number of providerscontacted per predetermined time period, a percentage of a target numberof providers contacted per predetermined time and/or any of thepreceding in a moving average format. In one embodiment, outlying datamay be identified and adjusted for.

Alternatively or additionally, as shown in block 810 of FIG. 8 anapparatus, such as the promotional system 1410, may include means, suchas the assignment module 106, the processor 1402 or the like foridentifying experience of one or more sales resources. Alternatively oradditionally, experience may be provided with respect to particularcategories, sub-categories, locations, and/or hyper-local regions withinwhich a sales resource has experience. Alternatively or additionally,experience may be indicated by a time measurement and/or a number ofleads closed.

As shown in block 812 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402 or the like for identifying expertise. In some exampleembodiments, the promotional system 1410 is configured to identify oraccess data indicating an expertise or an expertise score of one or moresales resources. Alternatively or additionally, experience may indicatecategories, sub-categories, locations, and/or hyper-local regions withinwhich a sales resource has expertise.

As shown in block 814 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402 or the like for calculating an assignment probabilitynumber. In some example embodiments, an assignment probability numberrepresents a probability that a sales resource will be randomly assignedto a next merchant in an assignment process. The assignment probabilitynumber may be calculated or assigned based on at least one of theassociated capacity, the associated experience, the associatedexpertise, the associated merchant mix of a sales resource, or anycombination thereof.

As shown in block 816 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may include means, such as the assignment module 106, theprocessor 1402 or the like for assigning merchant leads. In someexamples, the process for assigning a merchant to a resource may includea weighted random allocation, in some examples, a weighted randomallocation gives every resource a probability for receiving the newlead. In some example embodiments, assignment may be weighted based on alikelihood that a merchant will be contacted based on a daily capacityfor a representative. For example, a merchant may be less likely to beadded as 120^(th) on a list for a resource that averages 100 contactsper day. In further example embodiments, merchants may not be allocatedto a resource, if that merchant was de-allocated from that resource dueto inactivity. In some examples, a resource has a greater chance ofreceiving a merchant in an assignment list if the ordinal rank themerchant would fall within their call list within a specific timeperiod. In other examples, the resource may be more likely to receive amerchant if they have fewer leads or have a deficit related to aportfolio mix. In some examples, the leads may be assigned to new repsif they are easier to close so as to reduce attrition. In other examplesspecialization or strength of existing relationship could cause acertain lead to be assigned to a specific resource. In some examplesoutside resources may also be used.

In one embodiment, supply sources are considered one at a time andassignment probability numbers are determined for each of one or moresales resources before making an assignment. FIG. 12 shows an examplemethod for calculating and/or determining an assignment probabilitynumber for each of one or more sales resources. In one embodiment, salesresources are considered for each of one or more supply sources and anassignment probability number is calculated before each assignment. Inanother embodiment, assignment probability numbers are re-calculatedonce per specific time period, e.g., once per day. In one embodiment,once the assignment probabilities are calculated, each of one or moresupply sources are assigned based on the calculated assignmentprobability numbers.

In some example embodiments, merchants may be de-allocated and/orre-assigned according to predetermined metrics. For example, a merchantmay be re-assigned (1) if a sales resource has made no contact and/orhas no activity with a merchant for a predetermined period of time, thepredetermined period of time may be based on merchant information suchas lead source; (2) if a sales resource has made no contact and/or madeno activity within a predetermined period of time from a previousactivity; and (3) if a sales resource has no traction activity (e.g., 5minutes of contact) within a predetermined period of time. A merchantmay also be reassigned if a sales resource has not closed a contractwithin a predetermined period of time, the predetermined period of timebased on a merchant ranking. A merchant may also be reassigned if asales resource has closed a first contract, but has not closed a secondcontract within a predetermined period of time from expiration, thepredetermined period of time based on a merchant ranking. FIG. 13 showsan example method that may be executed to determine whether and when tode-allocate a supply source from a sales resource.

When re-assigning merchants, as opposed to assigning a new merchant to asales resource, predetermined rules may be used. For example, if amerchant is de-allocated from a first sales resource, duringre-allocation, the merchant may not be re-assigned to the first salesresource. In some example embodiments, a merchant may be re-assignedbased on a position on a potential sales resource's prioritized list.For example, a merchant that would be second on a first sales resource'sprioritized list may have a greater chance of being assigned to thefirst sales resource than a second sales resource where the merchant maybe third or lower in priority. In one embodiment, when a provider isde-allocated, previous contact history information associated with theprovider is stored and/or tracked and may be utilized in there-allocation process. For example, in an instance in which a providerhas responded poorly to sales resource contact attempts, an associatedprobability to close may be adjusted downward. In an instance in which aprovider has responded poorly to a number of resource contact attempts,a method of contact and/or a type of sales resource may be adjusted(e.g., changing from sales representatives to email marketing team orchanging from calling by phone to emailing). In one embodiment, in aninstance in which a provider has responded poorly to a number of salesresource contact attempts, an associated probability to close may beaffected to a point where the sales value calculation is lowered and theprovider is not re-assigned. In another embodiment, in an instance wherea provider has responded favorably to sales resource contact attempts,an associated probability to close may be increased. In one embodiment,the increase in probability to close may result in the provider beingre-assigned to a different sales resource type or contact method (e.g.,email to phone).

In one embodiment, prior activity information related to a provider maybe utilized to determine if several sales resources have tried andfailed to close them. In those cases, the provider may be moved to forexample, a sales resource comprised of a team of experts who specializein new approaches, or to an outside rep who can make an in person visit.The determination may be made based on a number of sales resources, forexample sales representatives that have made unsuccessful calls.Additionally or alternatively, the provider may be not allocated for apredetermined time (e.g., “rested”) and revived at a later point in timein case there is a change in management or circumstance.

As shown in block 818 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may be configured to generate one or more prioritized data,such as call lists, for each of one or more sales resources. Forexample, the prioritized data may include a prioritized call list uniqueto each individual representative. As shown in block 820 of FIG. 8, anapparatus, such as the promotional system 1410, may be configured toprovide the prioritized call list to one or more sales resources.

As shown in block 820 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may be configured to receive merchant information updatesand/or inventory information updates. For example, the assignment module106 may receive information related to a call being placed, a contractbeing closed, a merchant declining participation, etc.

As shown in block 824 of FIG. 8, an apparatus, such as the promotionalsystem 1410, may be configured to provide updated merchant informationand/or updated inventory information. For example, the assignment module106 may provide updated inventory information, such as for example aclosed contract, to the demand module 102, which then may be used toupdate available inventory and thus, update the forecasted demand. Insome example embodiments, promotional system 1410 may be updateddynamically each time a contract is closed. Alternatively, thepromotional system 1410 updates daily. An updating process may includeupdating a current inventory list and merchant database, re-calculatinga forecasted demand, re-adjusting a forecasted demand, re-calculatingmerchant score data, re-prioritizing merchants, updating sales resourceinformation regarding capacity, expertise and/or experience,re-assigning leads, and/or re-generating prioritized calls lists.

Commissions

In some examples, the assignment module 106 may also provide a point oraward structure to resources based a give point value to a merchantbased on a merchant value (e.g., sales value score) and a difficulty toclose (e.g. probability to close). Using the point values, resources maybe provided with a tiered commission rate based on the point valuethresholds. As such, the commission rewards can be viewed as amotivation or otherwise instant reward for closing an offer.

In some examples, the bounty or points may be assigned based on currentneeds and may be configured to dynamically change based on currentpriorities, inventories, mix and/or the like. In other cases, lowervalue merchants may rise based on changes in status, positive reviews orthe like. Alternatively or additionally, the point values may remainstatic when with a particular merchant, but may change if the merchantis reassigned.

In some example embodiments, the point value is assigned based oncurrently expected bookings (e.g., current demand *price point),intrinsic merchant value, intrinsic probability to close, productivityand/or the like. For example, the merchant value may be multiplied by1/probability to close and scaled using an exponential decay curve. Sucha curve is chosen because if a merchant as 50% probability to close,then it will take the resource 2 merchants to close. As such, thatmerchant may have a lower point value when compared to a merchant with a10% probability to close where it would take 10 merchants before thatresources can close a single offer. In some example embodiments, pointvalues assigned to a provider may be modified by the actual offer (e.g.,offer structure) that is closed with a provider. For example, lessefficient offer structures reduce the point values a sales resource maycapture.

In some examples, based on the programmatically determined point values,commission rates may be assigned based on the percentage of points totarget earned for a period. In some cases, the target may be changedbased on amount of time in the system, previous month's performanceand/or the like. In some example embodiments, additional points may beassigned based on closing of particular merchants, new merchants, highmargin merchants and/or the like.

Sales Automation Pipeline Example

FIG. 5A shows an exemplary embodiment of the aggregation of a forecasteddemand. As can be seen, a forecasted demand may be shown on a colorcoded map. Here, a forecasted demand for sushi in Chicago is shown.Hyper-local regions with higher levels of demand are shown in a darkercolor (e.g., red) while hyper-local regions with lower demand are shownin a lighter color (e.g., yellow). Demands of varying degrees are shownin color in between.

FIG. 5B shows an exemplary embodiment of the adjusted aggregation of aforecasted demand. As can be seen, an adjusted forecasted demand may beshown on a color coded map. Continuing from the example related to FIG.6A above, FIG. 5B shows an adjusted forecasted demand for sushi inChicago. Specifically, a forecasted demand map is shown after beingadjusted to account for the existing units of sushi in inventory. Theinventory or sushi may include sushi from merchants who have signedcontracts for offers but have not yet offered an offer, offers that areopen and have not yet expired and/or recurring offers that may beoffered again. Hyper-local regions with higher levels of unmet demandmay be shown in a darker color (e.g., red) while hyper-local regionswith lower unmet demand may be shown in a lighter color (e.g., yellow).Unmet demand of varying degrees may be shown in colors in between.

FIG. 5C shows an exemplary embodiment of block 710. As can be seen,merchants offering sushi in Chicago are identified. In some exampleembodiments, the information is shown overlaid onto the adjustedforecasted demand map. In some example embodiments, all merchants in alocation are identified and added to a database with the products and/orservices that the merchant offers. That database is then searched forthe merchants that offer a specific product, in the example above,sushi.

FIG. 5D shows an exemplary embodiment. Here, the identified merchantsare ranked. In some example embodiments, the merchants are ranked usingthe adjusted forecasted demand, merchant value, merchant quality score,risk potential, probability to close, time to close and/or the like.

FIG. 9 shows an exemplary embodiment of a prioritized call list. In someexample embodiments of the present invention, the prioritized call listutilizes the adjusted demand, the supply, the probability to close, andthe merchant quality score. The prioritized call list may also provideany needed contact information including names, numbers, hours. Theprioritized call list may further include one or more contact reasonswhich provide context to make the representative more effective. Theprioritized call list may further provide a representative with amerchant rating, a required or suggested product/service and desiredsupply, a price range, and/or hyper-local region (e.g., 550+ units/monthfrom $26-$50 for seafood in Middlesex).

Calculating a Probability that a Particular Consumer Would Buy aParticular Virtual Offer and Ranking Virtual Offers

FIG. 10 shows an example method, namely process 1000, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate a probabilitythat a consumer may buy a particular virtual offer and generate a rankedlist of virtual offers, in accordance with some embodiments discussedherein. As shown in block 1002 of FIG. 10, an apparatus, such as thepromotional system 1410, may be include means, such as the demand module102, the processor 1402, the communications interface 1406 or the like,for accessing or receiving virtual offer data and consumer data.

As shown in block 1004 of FIG. 10, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for extracting features from one or both ofone or more virtual offers and consumer data.

In some example embodiments, consumer data is stored in memory, such asmemory 304, and the consumer data is accessed from memory (e.g., a localmemory, a remote memory or the like) by, for example, a demand module102 or processor 1402. Consumer data may include, for example, age,gender, location, hyper-local region, and/or past purchase historyincluding specific offers, dates, cost expenditures, offer types, offerstructures, tenure, email domain information, etc. Consumer data may bethe accumulation of information related to each of or some portion of acurrent subscriber database. For example, tenure is an indication of thelength of time a user has been a subscriber. In another example, basedon the domain of the email address (such as Gmail®, Hotmail®, AOL®,etc.), the demand module 102, processor 1402 or the like may infercertain characteristics. For example, a AOL® user tends to be olderwhereas a Gmail® user tends to be younger.

In one embodiment, block 1004 may extract the distance between aconsumer and a virtual offer and a consumer's prior purchases in acategory. As another example, block 1004 may extract the age, gender ofa consumer, extract the category of the multiple virtual offers, andcalculate the distance between the consumer and the multiple virtualoffers. The features extracted may be input to the scoring/rankingalgorithm, which outputs a list of ranked deals.

Thus, as shown in block 1006 of FIG. 10, an apparatus, such as thepromotional system 1410, may include means, such as the demand module102, the processor 1402 or the like, for scoring each of one or morevirtual offers.

The scoring may be configured to score the plurality of virtual offersbased on explicit input by the consumer and/or extracted features fromthe consumer information. In the instance where the consumer selectscertain attributes of desired virtual offers, the selected attributes ofthe desired offers may be used at different points in the rankingprocess 1000. For example, process 1000 may select only the virtualoffers that meet the attributes as selected by the consumer. So that,the entire universe of virtual offers for scoring/review by the process1000 may be dictated by the consumer. In another embodiment, process1000 may factor in the consumer's desired attributes at a later point.In particular, the process 1000 may weigh the score depending on thedesired consumer attributes (such as improving the score of a virtualoffer that is characterized as a “family offer” if the consumer hasselected as an offer attribute “family offers” type). In addition tousing the desired attributes as selected by the consumer, the process1000 may examine other attributes of the consumer and attributes of theplurality of virtual offers to score the plurality of virtual offers. Ifthe consumer has not indicated a set of desired attributes, the process1000 may examine attributes of the consumer in the consumer profile inorder to evaluate which virtual offers to select for scoring andranking.

Block 1006 may be configured to predict the likelihood that a particularconsumer will purchase a particular offer that is offered to theconsumer. The indication of acceptance of the virtual offer may take oneof several forms, such as the conversion rate (the rate by which aconsumer accepts a virtual offer that is offered or the number ofpurchases of the virtual offer divided by the number of times thevirtual offer is offered to consumers) or another type of relevancescore. Block 1006 may be organized into different categories ofconsumers correlated with different categories (and subcategories) ofvirtual offer types. For example, the scoring model may aggregate thehistorical data from previously-run virtual offers and/or historicaldata from the virtual offer under consideration, organizing features ofconsumers (such as gender and distance from a virtual offer) with theconversion rates for categories/subcategories of virtual offers. Inparticular, Block 1006 may be segmented by consumers (such as males 0-2miles from the virtual offer, males 2-4 miles from the virtual offer,etc.) and segmented by virtual offers in differentcategories/subcategories (such as the category of restaurants, and thesubcategories of Italian restaurants, Greek restaurants, etc.). Block1006 may aggregate the data from the previous virtual offers in order togenerate the conversion rates for the consumers in the differentcategories (such as the conversion rate for consumers that are males 2-4miles from a Greek restaurant virtual offer in Chicago). The examples ofthe categories of consumers and the categories/subcategories of virtualoffers are merely for illustration purposes only. Other categories arecontemplated. For example, the categories of consumers may be subdividedinto gender, distance, and age. As another example, Block 1006 may besubdivided based on price of the virtual offer. The results of the Block1006 may be input to Block 1008, which may generate a ranked list ofvirtual offers according to the results.

As shown in block 1008 of FIG. 10, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for ranking each of one or more virtualoffers.

The results of Blocks 1006 and 1008 may generate a ranked list ofvirtual offers, which may thereafter be iteratively re-ranked accordingto further analysis of consumer data and/or virtual offer data.Alternatively, Block 1006 may output the scores for the multiple virtualoffers, and the scores may be iteratively modified (such as re-scored).After the final iteration, the scores may then be used to generate afinal ranking of some or all of the virtual offers in order to determinewhat virtual offer(s) to present to the consumer.

As shown in block 1010 of FIG. 10, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for adjusting the rankings of the one ormore virtual offers based on past purchase history information.

As shown in Block 1010, an adjustment may account for the consumer'spast purchase history by accessing a past purchase database in order togenerate a first reordered list of deals. Alternatively, the consumer'spast purchase history may be used to modify the initial scores. Forexample, a past purchase database may be part of the consumerinformation database 112 and indicate which categories (orsubcategories) of offers that the particular consumer previouslypurchased. The fact that the particular consumer has (or has not)previously purchased may be used in order to reorder the ranked list ofvirtual offers. For example, the ranked list of virtual offers for theparticular consumer may include the top “X” virtual offers, with each ofthe top “X” virtual offers having a particular category and subcategory.In the event that the consumer has previously purchased an offer in asubcategory for one (or more) of the top “X” virtual offers, the scoresassociated with those virtual offers may be modified (such as bymultiplying the score with a previous-purchase correction factor).Alternatively or in addition, in the event that the consumer has notpreviously purchased an offer in a subcategory for one (or more) of thetop “X” virtual offers, the scores associated with those deals may bemodified (such as by multiplying the score with a no-previous-purchasecorrection factor).

As shown in block 1012 of FIG. 10, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for adjusting the rankings of the one ormore virtual offers based on one or more business rules.

Block 1012 may account for particular business needs. Examples ofbusiness rules include, but are not limited to: rerunning an offer;offer de-duplicating; filtering targeted-only offers; and limitingextended access offers. Rerunning an offer may include running an offerpreviously run within a predetermined time period (such as 2 days ago, 2weeks ago, etc.). The algorithm may be programmed with a business rulein which offers are calculated for consumers who have not seen the offerbefore or who have not purchased the offer before. The time period thealgorithm examines may look back in time a predetermined amount, such as3 months. If the consumer has this offer as the top rank, and theconsumer has seen this type of offer before (or has purchased this typeof offer), then the consumer is shown something else.

Offer de-duplicating is a business rule that seeks to reduce sending ofduplicate offers to a consumer. De-duplicating may come in one ofseveral forms. One form is de-duplicating across a business (e.g., aparticular business may be running two virtual offers and the algorithmonly calculates the consumer probability for one of them (w/in aparticular time period). Another form is de-duplicating across the typeof virtual offer. It is possible to “clone” a virtual offer, such as byissuing the same virtual offer in multiple contexts (e.g., running atravel virtual offer in getaways and leisure). The algorithm may accountfor a previous purchase of an offer, and prevent calculation in adifferent context.

Filtering targeted-only virtual offers may occur when certain virtualoffers are filtered or removed from consideration or scoring. Somevirtual offers may be designated for specific targeting and are notconsidered in scoring. These virtual offers may be removed from thealgorithm process and give special consideration. These speciallyconsidered virtual offers may be tagged as such so that the algorithmdoes not analyze them.

Further, as shown in block 1014 of FIG. 10, an apparatus, such as thepromotional system 1410, may include means, such as the demand module102, the processor 1402 or the like, for adjusting the rankings of theone or more virtual offers based on desired placement constraints. Forexample, if it is desired that a certain maximum number or minimumnumber of people receive the virtual offer, the algorithm may bemodified or overridden. In particular, if it is desired that 500,000people receive the virtual offer, and the algorithm only selects 400,000people, the algorithm may be modified (such as the thresholds to issue avirtual offer, or a re-ranking of virtual offers) in order to issue thevirtual offer to the 500,000.

As shown in block 1016 of FIG. 10, an apparatus, such as the promotionalsystem 1410, may include means, such as the demand module 102, theprocessor 1402 or the like, for adjusting the rankings of the one ormore virtual offers based on diversity constraint information. Diversityconstraints may comprise giving pre-determined weight to specificcategories, sub-categories, locations, and/or price ranges.

Other iterations and potential correction factors are contemplated. Forexample, an interaction accounting for price of a virtual offer and aprice correction factor may be used. In one embodiment, virtual offersare scored and sorted based on an expected conversion rate. Price of thevirtual offers may be accounted thereafter by applying a priceadjustment factor, whereby the predicted conversion rate is adjusted bythe price of the virtual offer (such by multiplying the predictedconversion rate by the price of the virtual offer). In this way, thescoring and/or ranking of the virtual offers may be used to increase ormaximize revenue. The scoring and ranking may provide initial scores tothe multiple virtual offers. In an alternate embodiment, the scoring andranking may be used after the initial scoring of the multiple virtualoffers, so that the scoring and ranking may be used to adjust or modifyprevious scores or rankings.

Supply Source Quality Score Calculation Example

FIG. 11 shows an example method, namely process 1100, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate a supply sourcequality score, in accordance with some embodiments discussed herein. Asshown in block 1102 of FIG. 11, an apparatus, such as the promotionalsystem 1410, may be include means, such as the supply ID module 104, theprocessor 1402, or the like, for determining if a supply source has anoverall star average greater than or equal to at least a 3.0 withgreater than or equal to at least 5 total reviews.

If the determination at block 1102 yields a yes, the process 1100proceeds to block 1104. As shown in block 1104 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an overall star average greater than or equal toat least a 4.5 with greater than or equal to at least 500 total numberreviews.

If the determination at block 1104 yields a yes, the process 1100proceeds to block 1106. As shown in block 1106 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has a positive press review or award from an acceptedsource.

If the determination at block 1106 yields a yes, the process 1100proceeds to block 1108. As shown in block 1108 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for assigning asupply source a score of 10.

If the determination at block 1104 yields a no, the process 1100proceeds to block 1110. As shown in block 1110 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an overall star average greater than or equal toat least a 4.0 with greater than or equal to at least 20 total reviews.

If the determination at block 1110 yields a yes, the process 1100proceeds to block 1112. As shown in block 1112 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for assigning asupply source a score of 8.

If the determination at block 1110 yields a no, the process 1100proceeds to block 1114. As shown in block 1114 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an overall star average of greater than or equalto at least a 4.0 with greater than or equal to at least 5,000 “likes”,such as for example, Facebook® “likes”.

If the determination at block 1114 yields a yes, the process 1100proceeds to block 1112, where the supply source is assigned a score of8. If the determination at block 1114 yields a no, the process 1100proceeds to block 1116. As shown in block 1116 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for assigning asupply source a score of 6.

If the determination at block 1102 yields a no, the process 1100proceeds to block 1118. As shown in block 1118 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an overall star rating of less than or equal toat least a 2.49 with greater than or equal to at least 5 total reviews.

If the determination at block 1118 yields a yes, the process 1100proceeds to block 1120. As shown in block 1120 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for assigning asupply source a score of 1.

If the determination at block 1118 yields a no, the process 1100proceeds to block 1122. As shown in block 1122 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an overall star average of greater than or equalto at least a 3.0.

If the determination at block 1122 yields a no, the process 1100proceeds to block 1124. As shown in block 1124 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for assigning asupply source a score of 4.

If the determination at block 1122 yields a yes, the process 1100proceeds to block 1126. As shown in block 1126 of FIG. 11, an apparatus,such as the promotional system 1410, may be include means, such as thesupply ID module 104, the processor 1402, or the like, for determiningif a supply source has an a positive press review or award from anacceptable source and has greater than or equal to at least 5,000“likes”, such as for example, Facebook® “likes”.

If the determination at block 1126 yields a no, the process 1100proceeds to block 1124 where the supply source is assigned a score of 4.If the determination at block 1126 yields a yes, the process 1100proceeds to block 1114.

As shown in block 1128 of FIG. 11, an apparatus, such as the promotionalsystem 1410, may be include means, such as the supply ID module 104, theprocessor 1402, or the like, for determining if a supply source isclosed or determining if a supply source is closed is impossible. Ifblock 1128 determines that a supply source is closed or cannot tell ifthe supply source is closed, the process 1100 proceeds to block 1120where the supply source is assigned a score of 1.

Calculating an Assignment Probability Number

FIG. 12 shows an example method, namely process 1200, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to calculate or determine anassignment probability number for each of one or more sales resourcesfor assignment purposes, in accordance with some embodiments discussedherein. As shown in block 1202 of FIG. 12, an apparatus, such as thepromotional system 1410, may be include means, such as the assignmentmodule 106, the processor 1402, or the like, for receiving a prioritizedlist of supply sources.

As shown in block 1204 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for accessing a first supply source forassignment.

As shown in block 1206 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for resetting the assignmentprobability numbers for each of one or more sales resources.

As shown in block 1208 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for considering each sales resource forassignment.

As shown in block 1210 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether a capacity of asales resource meets a predetermined threshold. For example, a salesresource with the required amount of supply sources in their prioritizedcall list may have zero capacity whereas a sales resource with only 90%of the required supply sources in their prioritized call list will havea higher capacity than zero.

If the determination in block 1210 yields a no, the process 1200 thengoes to block 1212. As shown in block 1212 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1210 yields a yes, the process 1200 thengoes to block 1214. As shown in block 1214 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1216 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the portfoliomix of the sales resource meet a predetermined threshold in one or moreof the category, sub-category, location, hyper-local region and price ofthe supply source.

If the determination in block 1216 yields a no, the process 1200 thengoes to block 1218. As shown in block 1218 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1216 yields a yes, the process 1200 thengoes to block 1220. As shown in block 1220 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1222 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the experienceand/or expertise of the sales resource meet a predetermined threshold inone or more of the category, sub-category, location, hyper-local regionand price of the supply source. In one example, the lead allocationprocess seeks to distinguish between experience with new supply sourcesand supply sources with which a relationship already exists. In oneembodiment, experience and/or expertise of a sales resource mayadditionally or alternatively, indicate or distinguish experience and/orexpertise with providers with which the promotion and marketing systemhas no existing relationship and providers with which the promotion andmarketing system does have a previous and/or existing relationship. Forexample, a sales resource who has more success (relatively) in closingproviders who have never offered a promotion with the promotion andmarketing system will have an experience and expertise score thatreflects that information and thus, are more likely to be assigned newproviders. Additionally or alternatively, a sales resource who has moresuccess (relatively) in extending past or existing relationships withproviders may have an experience and/or expertise score reflecting thatinformation and may be more likely to be assigned providers with which arelationship exists.

In another embodiment, the lead allocation process seeks to optimizetravel time for sales resources. In an example embodiment, an experienceor expertise score may reflect a higher level or score for providers ina specific location or hyper local region. In another embodiment, anexperience and/or expertise level and/or score may be affected by thelocations and/or hyper local regions of other providers on a salesresource's provider list. For example, if provider A is already assignedto a sales resource, the sales resource may be more likely to beassigned provider B, who is closer to provider A, than a provider C, whois further away from provider A. Such assignment may be implemented inan embodiment in which an experience and/or expertise score and/level isadjusted based on the locations and/or hyper local regions of providersalready assigned to the sales resource.

In another embodiment, in terms of expertise, a sales resource mayspecialize in quickly closing new providers or reaching out to providersin order to fulfill demand. For example, providers who contact thepromotion and marketing service are thought to be interested in workingwith the promotion and marketing service and thus, may be more likely tobe assigned to a sales resource, for example a team that specializes inquickly closing and getting those providers closed.

If the determination in block 1222 yields a yes, the process 1200 thengoes to block 1224. As shown in block 1224 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1222 yields a no, the process 1200 thengoes to block 1226. As shown in block 1226 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1228 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the supplysource would rank higher in the prioritized call list of the salesresource than it would in an average prioritized call list.

If the determination in block 1228 yields a no, the process 1200 thengoes to block 1230. As shown in block 1230 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1228 yields a yes, the process 1200 thengoes to block 1232. As shown in block 1232 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1234 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the salesresource has a relationship with the supply source.

If the determination in block 1234 yields a yes, the process 1200 thengoes to block 1236. As shown in block 1236 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1234 yields a no, the process 1200 thengoes to block 1238. As shown in block 1238 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1240 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the supplysource has ever been de-allocated form the sales resource.

If the determination in block 1240 yields a no, the process 1200 thengoes to block 1242. As shown in block 1242 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1240 yields a yes, the process 1200 thengoes to block 1244. As shown in block 1244 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1246 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the salesresource received the previous supply source.

If the determination in block 1246 yields a no, the process 1200 thengoes to block 1248. As shown in block 1248 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1246 yields a yes, the process 1200 thengoes to block 1250. As shown in block 1250 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1252 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for determining whether the prioritizedcall list of the sales resource meets a predetermined threshold for newsupply sources.

If the determination in block 1252 yields a no, the process 1200 thengoes to block 1254. As shown in block 1254 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for increasingthe assignment probability number of the sales resource.

If the determination in block 1252 yields a yes, the process 1200 thengoes to block 1256. As shown in block 1256 of FIG. 12, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for decreasingthe assignment probability number of the sales resource.

As shown in block 1258 of FIG. 12, an apparatus, such as the promotionalsystem 1410, may be include means, such as the assignment module 106,the processor 1402, or the like, for assigning a supply source to salesresource based on the assignment probability number of each of one ormore sales resources.

Example De-Allocation Process

FIG. 13 shows an example method, namely process 1300, that may beexecuted by one or more machines (some examples of which are discussedin connection with FIGS. 1, 2 a, and/or 3) to determine whether and whento de-allocate a supply source from a sales resource, in accordance withsome embodiments discussed herein. As shown in block 1302 of FIG. 13, anapparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining whether a supply source has an unexpired promotion.

If the determination in block 1302 yields a yes, the process 1300 thengoes to block 1304. As shown in block 1304 of FIG. 13, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for determiningwhether the sales resource has left the company.

If the determination in block 1304 yields a yes, the process 1300 thengoes to block 1306. As shown in block 1306 of FIG. 13, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, forde-allocating the supply source. The supply source may then be re-scoredand/or re-assigned.

If the determination in block 1304 yields a no, the process 1300 thengoes to block 1308. As shown in block 1308 of FIG. 13, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for determiningthat the supply source is not to be de-allocated at the current time.The process may then return to block 1302.

If the determination in block 1302 yields a no, the process 1300 thengoes to block 1310. As shown in block 1310 of FIG. 13, an apparatus,such as the promotional system 1410, may be include means, such as theassignment module 106, the processor 1402, or the like, for determining,in an instance in which a supply source has a warm lead, whether thesales resource has contacted the supply source within 2 days.

If the determination in block 1310 yields a no, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1310 yields a yes or not applicable, theprocess 1300 then goes to block 1312. As shown in block 1312 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining, in an instance in which a supply source does not have awarm lead, whether the sales resource has contacted the supply sourcewithin 10 days.

If the determination in block 1312 yields a no, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1312 yields a yes or not applicable, theprocess 1300 then goes to block 1314. As shown in block 1314 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining whether a sales resource has made contact within 35 dayssince a previous promotion expired.

If the determination in block 1314 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1314 yields a no or not applicable, theprocess 1300 then goes to block 1316. As shown in block 1316 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining whether a sales resource has made traction meeting apredetermined threshold within 60 days since a previous promotionexpired.

If the determination in block 1316 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1316 yields a no or not applicable, theprocess 1300 then goes to block 1318. As shown in block 1318 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining, for supply sources having scores above a predeterminedthreshold and where sales resource has not previously closed a contractwith the supply source, whether the sales resource has not closed acontract within 120 days.

If the determination in block 1318 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1318 yields a no or not applicable, theprocess 1300 then goes to block 1320. As shown in block 1318 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining, for supply sources having scores below a predeterminedthreshold and where sales resource has not previously closed a contractwith the supply source, whether the sales resource has not closed acontract within 90 days.

If the determination in block 1320 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1320 yields a no or not applicable, theprocess 1300 then goes to block 1322. As shown in block 1322 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining, for supply sources having scores above a predeterminedthreshold and where sales resource has previously closed a contract withthe supply source, if the sales resource has not closed a contractwithin 180 days.

If the determination in block 1322 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1322 yields a no or not applicable, theprocess 1300 then goes to block 1324. As shown in block 1324 of FIG. 13,an apparatus, such as the promotional system 1410, may be include means,such as the assignment module 106, the processor 1402, or the like, fordetermining, for supply sources having scores below a predeterminedthreshold and where sales resource has previously closed a contract withthe supply source, if the sales resource has not closed a contractwithin 120 days.

If the determination in block 1324 yields a yes, the process 1300 thengoes to block 1306 where the supply source is de-allocated from thesales resource.

If the determination in block 1324 yields a no or not applicable, theprocess 1300 may end. Process 1300 may also determine that the supplysource is not to be de-allocated and/or return to block 1302.

Claims in Summary Form from First Demand Forecasting App

In one embodiment, a method for virtual offer demand forecasting isprovided. The method may comprise generating a virtual offer for one ormore combinations of a category or sub-category, location, and pricerange, accessing consumer data comprising one or more users and userdata related to each of the one or more users, calculating a probabilitythat a particular user would buy a particular offer in a particular timeframe for at least a portion of the plurality of users and for each ofthe virtual offers, and determining an estimated number of units of tobe sold for at least a portion of the one or more virtual offers as afunction of at least the probability associated with each of the one ormore virtual offers.

In another embodiment, calculating a forecasted demand comprisesadjusting the forecasted demand as a function of one or more externalfactors. In another embodiment, the method may further comprisegenerating a ranked user list for each of the one or more userscomprising each of the one or more virtual offers and an associatedcalculated probability, assigning a voting value to each of the one ormore virtual offers on each ranked user list, and generating a singlelist ranking each of the one or more virtual offers by adding the votingvalue each of the one or more virtual offers received on each rankeduser list.

In another embodiment, the determining of the estimated number of unitsto be sold for is only for a predetermined number of virtual offers, andis based on the ranking of each of the one or more virtual offers on thesingle list. In another embodiment, the selecting of the one or morevirtual offers further comprises calculating a projected revenue valuefor each virtual offer based on prior performance data per unit and theestimated number of units to be sold, ranking the one or more virtualoffers by the projected revenue, and selecting one or more virtualoffers to include in the forecasted demand based on the ranking of eachof the one or more virtual offers by revenue and a pre-selectedportfolio mix.

In another embodiment, the one or more external factors includes atleast a seasonality component. In another embodiment, a virtual offercomprises at least price data, one product category or one servicecategory, and location data. In another embodiment, the voting value isderived from a position of the one or more virtual offers on the rankedlists generated for each of the one or more users, wherein at least apredetermined number of virtual offers on each ranked list are assigneda first voting value. In another embodiment, the pre-selected portfoliomix comprises at least one of: a category mix, a price mix, or locationconstraints. In another embodiment, one or more combinations of categoryor sub-category, location and price range are generated for a specifiedtime period.

In another embodiment of the present invention an apparatus is provided,the apparatus comprising at least one processor and at least one memoryincluding computer program code, the at least one memory and thecomputer program code configured to, with the at least one processor,cause the apparatus at least to generate a virtual offer for one or morecombinations of a category or sub-category, location, and price range,access consumer data comprising one or more users and user data relatedto each of the one or more users, calculate a probability that aparticular user would buy a particular offer in a particular time framefor at least a portion of the plurality of users and for each of thevirtual offers, and determining an estimated number of units of to besold for at least a portion of the one or more virtual offers as afunction of at least the probability associated with each of the one ormore virtual offers.

In another embodiment, calculating a forecasted demand comprisesadjusting the forecasted demand as a function of one or more externalfactors. In another embodiment, the at least one memory and computerprogram code are configured to, with the at least one processor, causethe apparatus to generate a ranked user list for each of the one or moreusers comprising each of the one or more virtual offers and anassociated calculated probability, assign a voting value to each of theone or more virtual offers on each ranked user list, and generate asingle list ranking each of the one or more virtual offers by adding thevoting value each of the one or more virtual offers received on eachranked user list.

In another embodiment, the determining of the estimated number of unitsto be sold for is only for a predetermined number of virtual offers, andis based on the ranking of each of the one or more virtual offers on thesingle list. In another embodiment, the selecting of the one or morevirtual offers further comprises calculating a projected revenue valuefor each virtual offer based on prior performance data per unit and theestimated number of units to be sold, ranking the one or more virtualoffers by the projected revenue, and selecting one or more virtualoffers to include in the forecasted demand based on the ranking of eachof the one or more virtual offers by revenue and a pre-selectedportfolio mix.

In another embodiment, the one or more external factors includes atleast a seasonality component. In another embodiment, a virtual offercomprises at least price data, one product category or one servicecategory, and location data. In another embodiment, the voting value isderived from a position of the one or more virtual offers on the rankedlists generated for each of the one or more users, wherein at least apredetermined number of virtual offers on each ranked list are assigneda first voting value. In another embodiment, the pre-selected portfoliomix comprises at least one of: a category mix, a price mix, or locationconstraints. In another embodiment, one or more combinations of categoryor sub-category, location and price range for a specified time period.

In another embodiment of the present invention, a computer programproduct is provided. The computer program product may comprise at leastone computer-readable storage medium having computer-executable programcode instructions stored therein, the computer-executable program codeinstructions comprising program code instructions for generating avirtual offer for one or more combinations of a category orsub-category, location, and price range, accessing consumer datacomprising one or more users and user data related to each of the one ormore users, calculating a probability that a particular user would buy aparticular offer in a particular time frame for at least a portion ofthe plurality of users and for each of the virtual offers, anddetermining an estimated number of units of to be sold for at least aportion of the one or more virtual offers as a function of at least theprobability associated with each of the one or more virtual offers.

In another embodiment, calculating a forecasted demand comprisesadjusting the forecasted demand as a function of one or more externalfactors. In another embodiment, the computer-executable program codeportions further comprise program code instructions for generating aranked user list for each of the one or more users comprising each ofthe one or more virtual offers and an associated calculated probability,assigning a voting value to each of the one or more virtual offers oneach ranked user list, generating a single list ranking each of the oneor more virtual offers by adding the voting value each of the one ormore virtual offers received on each ranked user list.

In another embodiment, the determining of the estimated number of unitsto be sold for is only for a predetermined number of virtual offers, andis based on the ranking of each of the one or more virtual offers on thesingle list. In another embodiment, the selecting of the one or morevirtual offers further comprises calculating a projected revenue valuefor each virtual offer based on prior performance data per unit and theestimated number of units to be sold and ranking the one or more virtualoffers by the projected revenue, and selecting one or more virtualoffers to include in the forecasted demand based on the ranking of eachof the one or more virtual offers by revenue and a pre-selectedportfolio mix.

In another embodiment, the one or more external factors includes atleast a seasonality component. In another embodiment, a virtual offercomprises at least price data, one product category or one servicecategory, and location data. In another embodiment, the voting value isderived from a position of the one or more virtual offers on the rankedlists generated for each of the one or more users, wherein at least apredetermined number of virtual offers on each ranked list are assigneda first voting value. In another embodiment, the pre-selected portfoliomix comprises at least one of: a category mix, a price mix, or locationconstraints. In another embodiment, one or more combinations of categoryor sub-category, location and price range for a specified time period.

Promotion and Marketing System Plus Boilerplate

FIG. 14 illustrates an example network architecture for a system inaccordance with some embodiments discussed herein. System 1400 mayinclude one or more devices and sub-systems that are configured toimplement some of the example embodiments discussed herein. For example,system 1400 may include promotional system 1410, which may include, forexample, a processor 1402, memory 1404, a communications interface 1406,and a user interface (not shown). Memory 1404 may include promotionalcomputing device 1412.

Promotional system 1410 can be coupled to one or more salespersondevices 1440A-1440Z, a search engine system 1442, one or more consumerdevices 1444A-1444N, a 3^(rd) party server 1446, and/or one or moremerchant devices 1448A-1448M via network 1450. In this regard, network1450 may include any wired or wireless communication network including,for example, a wired or wireless local area network (LAN), personal areanetwork (PAN), metropolitan area network (MAN), wide area network (WAN),or the like, as well as any hardware, software and/or firmware requiredto implement it (such as, e.g., network routers, etc.). For example,network 1450 may include a cellular telephone, an 802.11, 802.16,802.20, and/or WiMax network. Further, the network 1450 may include apublic network, such as the Internet, a private network, such as anintranet, or combinations thereof, and may utilize a variety ofnetworking protocols now available or later developed including, but notlimited to TCP/IP based networking protocols. Furthermore, Promotionalsystem 1410 can be coupled to one or more salesperson devices1440A-1440Z directly via any wired or wireless communication networkincluding, for example, a wired or wireless local area network (LAN),personal area network (PAN), metropolitan area network (MAN), wide areanetwork (WAN), or the like, as well as any hardware, software and/orfirmware required to implement it.

Salesperson devices 1440A-1440Z, consumer devices 1444A-1444N, and/ormerchant devices 1448A-1448M may each be implemented as a personalcomputer and/or other networked device, such as a cellular phone, a“smartphone”, a tablet computer, mobile device, etc., that may be usedfor any suitable purpose in addition to buying or selling offers. Thedepiction in FIG. 14 of “N” consumers, “M” merchants, and “Z”salespersons is merely for illustration purposes. System 1400 may alsoinclude at least one search engine system 1442 and/or third party server1446, among other things.

Memory 1404 of promotional system 1410 may include Promotional computingdevice 1412, a consumer database 1432, a virtual offer engine 1434,offer inventory 1436, and merchant database 1438 and/or other programsand data repositories 1430. Promotional computing device 1412 can be anysuitable network server and/or other type of processing device. Consumerdatabase 1432, virtual offer engine 1434, offer inventory 1436, merchantdatabase 1438 and/or other programs and data repositories 1430 may beany suitable network database configured to store offer parameter data,consumer account information, merchant account information and/oranalytics data, such as that discussed herein. In this regard,promotional system 1410 may include, for example, at least one backenddata server, network database, cloud computing device, among otherthings.

Regarding promotional system 1410, FIG. 14 shows a schematic blockdiagram of circuitry, some or all of which may be included. Asillustrated in FIG. 14, in accordance with some example embodiments, thecircuitry can includes various means, such as processor 1402, memory1404, communications interface 1406, and/or input/output module 1408. Asreferred to herein, “module” includes hardware, software and/or firmwareconfigured to perform one or more particular functions. In this regard,the means of the merchant device's circuitry as described herein may beembodied as, for example, circuitry, hardware elements (e.g., a suitablyprogrammed processor, combinational logic circuit, and/or the like), acomputer program product comprising computer-readable programinstructions stored on a non-transitory computer-readable medium (e.g.,memory 1404) that is executable by a suitably configured processingdevice (e.g., processor 1402), or some combination thereof.

In addition, promotional system 1410 may comprise one or more distinctcomputing systems/devices and may span distributed locations. In otherexample embodiments, a pre-processing module or other module thatrequires heavy computational load may be configured to perform thatcomputational load and thus may be on a remote device or server.Furthermore, each block shown may represent one or more such blocks asappropriate to a specific example embodiment. In some cases one or moreof the blocks may be combined with other blocks.

Processor 1402 may, for example, be embodied as various means includingone or more microprocessors with accompanying digital signalprocessor(s), one or more processor(s) without an accompanying digitalsignal processor, one or more coprocessors, one or more multi-coreprocessors, one or more controllers, processing circuitry, one or morecomputers, various other processing elements including integratedcircuits such as, for example, an application specific integratedcircuit (ASIC) or field programmable gate array (FPGA), or somecombination thereof. Accordingly, although illustrated in FIG. 14 as asingle processor, in some embodiments, processor 1402 comprises aplurality of processors. The plurality of processors may be embodied ona single computing device or may be distributed across a plurality ofcomputing devices collectively. The plurality of processors may be inoperative communication with each other and may be collectivelyconfigured to perform one or more functionalities of promotional system1410 as described herein. In an example embodiment, processor 1402 isconfigured to execute instructions stored in memory 1404 or otherwiseaccessible to processor 1402. These instructions, when executed byprocessor 1402, may cause promotional system 1410 to perform one or moreof the functionalities as described herein.

Whether configured by hardware, firmware/software methods, or by acombination thereof, processor 1402 may comprise an entity capable ofperforming operations according to embodiments of the present inventionwhile configured accordingly. Thus, for example, when processor 1402 isembodied as an ASIC, FPGA or the like, processor 1402 may comprisespecifically configured hardware for conducting one or more operationsdescribed herein. Alternatively, as another example, when processor 1402is embodied as an executor of instructions, such as may be stored inmemory 1404, the instructions may specifically configure processor 1402to perform one or more algorithms and operations described herein, suchas those discussed in connection with FIGS. 4, 5, 7, and 8.

Memory 1404 may comprise, for example, volatile memory, non-volatilememory, or some combination thereof. Although illustrated in FIG. 14 asa single memory, memory 1404 may comprise a plurality of memorycomponents. The plurality of memory components may be embodied on asingle computing device or distributed across a plurality of computingdevices. In various embodiments, memory 1404 may comprise, for example,a hard disk, random access memory, cache memory, flash memory, a compactdisc read only memory (CD-ROM), digital versatile disc read only memory(DVD-ROM), an optical disc, circuitry configured to store information,or some combination thereof. Memory 1404 may be configured to storeinformation, data (including offer parameter data, consumer data,inventory data and/or analytics data), applications, instructions, orthe like for enabling promotional system 1410 to carry out variousfunctions in accordance with example embodiments of the presentinvention. For example, in at least some embodiments, memory 1404 isconfigured to buffer input data for processing by processor 1402.Alternatively or additionally, in at least some embodiments, memory 1404is configured to store program instructions for execution by processor1402. Memory 1404 may store information in the form of static and/ordynamic information. This stored information may be stored and/or usedby salesperson device 1440 during the course of performing itsfunctionalities.

Communications interface 1406 may be embodied as any device or meansembodied in circuitry, hardware, a computer program product comprisingcomputer readable program instructions stored on a computer readablemedium (e.g., memory 1404) and executed by a processing device (e.g.,processor 1402), or a combination thereof that is configured to receiveand/or transmit data from/to another device, such as, for example,salesperson device 1440, consumer device 1444, merchant device 1448and/or the like. In some embodiments, communications interface 1406(like other components discussed herein) can be at least partiallyembodied as or otherwise controlled by processor 1402. In this regard,communications interface 1406 may be in communication with processor1402, such as via a bus. Communications interface 1406 may include, forexample, an antenna, a transmitter, a receiver, a transceiver, networkinterface card and/or supporting hardware and/or firmware/software forenabling communications with another computing device. Communicationsinterface 1406 may be configured to receive and/or transmit any datathat may be stored by memory 1404 using any protocol that may be usedfor communications between computing devices. Communications interface1406 may, alternatively or additionally, be in communication with thememory 1404, input/output module 1408 and/or any other component ofpromotional system 1410, such as via a bus.

Input/output module 1408 may be in communication with processor 1402 toreceive an indication of a user input and/or to provide an audible,visual, mechanical, or other output to a user (e.g., merchant and/orconsumer). As such, input/output module 1408 may include support, forexample, for a keyboard, a mouse, a joystick, a display, a touch screendisplay, a microphone, a speaker, a RFID reader, credit card reader,barcode reader, biometric scanner, and/or other input/output mechanismsas represented by 1408. Input/output module 1408 may be in communicationwith the memory 1404, communications interface 1406, and/or any othercomponent(s), such as via a bus. Although more than one input/outputmodule and/or other component can be included in promotional system1410, only one is shown in FIG. 14 to avoid overcomplicating the drawing(like the other components discussed herein).

FIG. 14 also shows an example circuitry that may be included inpromotional computing device 1412, which may be configured to performthe analysis, calculation, management and/or other functionalitydiscussed in connection with promotional system 1410. In this manner,from the merchant's perspective, promotional computing device 1412 mayprovide cloud computing functionality and services to the merchant. Asillustrated in FIG. 14 and in accordance with some example embodiments,promotional computing device 1412 can includes various means, such asdemand module 102, supply ID module 104, and/or assignment module 106.

Demand module 102 may be included and configured to perform thefunctionality discussed herein related to generating, calculating,adjusting, managing, and/or editing demand. In some embodiments, some orall of the functionality of generating, calculating, adjusting and/orediting demand may be performed by processor 1402. In this regard, theexample processes and algorithms discussed herein can be performed by atleast one processor 1402 and/or demand module 102. For example,non-transitory computer readable media can be configured to storefirmware, one or more application programs, and/or other software, whichinclude instructions and other computer-readable program code portionsthat can be executed to control each processor (e.g., processor 1402and/or demand module 102) of the components of promotional computingdevice 1412 to implement various operations, including the examplesshown above. As such, a series of computer-readable program codeportions are embodied in one or more computer program products and canbe used, with a computing device, server, and/or other programmableapparatus, to produce machine-implemented processes.

For example, demand module 102 may be configured to receive virtualoffers and apply current consumer and/or subscriber information in orderto calculate a forecasted demand. Alternatively or additionally, thedemand module 102 can be configured to adjust demand based on currentinventory and/or external factors. As a result of this calculation andadjustment, demand module 102 can be configured to output a forecasteddemand.

The demand module 102 may be configured to access consumer data, such asfrom database 1432, comprising one or more users and user data relatedto each of the one or more users and calculate a probability that aparticular user would buy a particular offer in a particular time framefor at least a portion of the plurality of users and for each of thevirtual offers. The demand module 102 may also be configured to access aprogram 1430 that may calculate a probability that a specific individualconsumer may purchase a specific virtual offer. The demand module 102may be configured to aggregate the probabilities, for each of one ormore virtual offers, and each of one or more consumers.

Supply ID module 104 can be configured to receive a forecasted demandand access a merchant database for the purpose of identifying merchantscapable of meeting the demand. In order to identify merchants capable ofmeeting this demand, the supply ID module 104 may be configured tocalculate merchant value, calculate a merchant quality score, calculatea risk potential, calculate a probability to close, and calculate a timeto close. Alternatively or additionally, the supply ID module 104 can beconfigured to prioritize the merchants based on the aforementionedfactors. For example, supply ID module 104 can be the component ofpromotional computing device 1412 that is configured to receive aninventory adjusted demand, access a merchant database, and identifyand/or prioritize the merchants in such a way as to convey to a salesteam and/or salesperson which merchants offer the most value, withregard to time spent, in fulfilling the inventory adjusted demand. Thesupply ID module 104 may be configured to calculate one or more metricsrelated to a merchant. For example, on a per merchant basis, the supplyID module 104 may be configured to determine a sales value score basedon the ability of each merchant to supply a demanded offer. The supplyID module 104 may be configured to calculate a quality score, anexpected amount of bookings in units and/or dollars, a time to closeand/or a probability to close. Alternatively or additionally, the supplyID module 104 may calculate a return on investment value for one or moremerchants and/or offers. The supply ID module 104 may be configured tocalculate a merchant return rate, an offer value, and/or a merchantvalue. The supply ID module 104 may be configured to determine valuebased on each minute incremental minute of a salesperson's time and canbe configured to determine value based on the merchant quality score,the risk potential, the probability to close, and/or a time to close.Although supply ID module 104 is shown as being a single module includedin single promotional computing device, both the promotional computingdevice and/supply ID module 104 (like other devices and componentsdiscussed herein) can be embodied as a plurality of distributed systems,apparatuses, and/or any other suitable machine(s).

Further description related to current inventory is found in U.S.Provisional Patent Application No. 61/682,762, filed Aug. 13, 2012,titled “UNIFIED PAYMENT AND RETURN ON INVESTMENT SYSTEM”, and U.S.patent application Ser. No. 13/460,745, filed Apr. 30, 2012, titled“SALES ENHANCEMENT SYSTEM”, both of which is hereby incorporated byreference.

Assignment module 106 may be configured to receive a prioritizedmerchant list and/or a salesperson list. Alternatively or additionally,the assignment module 106 can be configured to access a prioritizedmerchant data and/or salesperson data. Furthermore, the assignmentmodule 106 can be configured to identify capacity of one or moresalespersons, identify experience of one or more salespersons, and/oridentify expertise of one or more salespersons and assign merchant leadsbased on one or more of the aforementioned factors. Alternatively oradditionally, the assignment module 106 may be configured to generateand/or provide a prioritized call list for one or more salespersons. Theassignment module 106 may also be configured to receive updated merchantand/or inventory from, for example, the salespersons utilizing theprioritized call list and provide that information to the demand module102, the supply ID module 104, memory 1404, and/or processor 1402 or thelike.

As will be appreciated, any such computer program instructions and/orother type of code may be loaded onto a computer, processor or otherprogrammable apparatus's circuitry to produce a machine, such that thecomputer, processor other programmable circuitry that execute the codeon the machine create the means for implementing various functions,including those described herein.

As described above and as will be appreciated based on this disclosure,embodiments of the present invention may be configured as methods,mobile devices, backend network devices, and the like. Accordingly,embodiments may comprise various means including entirely of hardware orany combination of software and hardware. Furthermore, embodiments maytake the form of a computer program product on at least onenon-transitory computer-readable storage medium having computer-readableprogram instructions (e.g., computer software) embodied in the storagemedium. Any suitable computer-readable storage medium may be utilizedincluding non-transitory hard disks, CD-ROMs, flash memory, opticalstorage devices, or magnetic storage devices.

Embodiments of the present invention have been described above withreference to block diagrams and flowchart illustrations of methods,apparatuses, systems and computer program products. It will beunderstood that each block of the circuit diagrams and processflowcharts, and combinations of blocks in the circuit diagrams andprocess flowcharts, respectively, can be implemented by various meansincluding computer program instructions. These computer programinstructions may be loaded onto a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the computer program product includes theinstructions which execute on the computer or other programmable dataprocessing apparatus create a means for implementing the functionsspecified in the flowchart block or blocks.

These computer program instructions may also be stored in acomputer-readable storage device that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablestorage device produce an article of manufacture includingcomputer-readable instructions for implementing the function discussedherein. The computer program instructions may also be loaded onto acomputer or other programmable data processing apparatus to cause aseries of operational steps to be performed on the computer or otherprogrammable apparatus to produce a computer-implemented process suchthat the instructions that execute on the computer or other programmableapparatus provide steps for implementing the functions discussed herein.

Accordingly, blocks of the block diagrams and flowchart illustrationssupport combinations of means for performing the specified functions,combinations of steps for performing the specified functions and programinstruction means for performing the specified functions. It will alsobe understood that each block of the circuit diagrams and processflowcharts, and combinations of blocks in the circuit diagrams andprocess flowcharts, can be implemented by special purpose hardware-basedcomputer systems that perform the specified functions or steps, orcombinations of special purpose hardware and computer instructions.

Many modifications and other embodiments of the inventions set forthherein will come to mind to one skilled in the art to which theseembodiments of the invention pertain having the benefit of the teachingspresented in the foregoing descriptions and the associated drawings.Therefore, it is to be understood that the embodiments of the inventionare not to be limited to the specific embodiments disclosed and thatmodifications and other embodiments are intended to be included withinthe scope of the appended claims. Although specific terms are employedherein, they are used in a generic and descriptive sense only and notfor purposes of limitation.

That which is claimed:
 1. A method comprising: accessing, in real-time,user search data, the user search data generated by a user interactingwith a promotion and marketing service to identify a requestedpromotion, the user search data comprising at least location specificdata; generating a promotion tuple from the search data, the promotiontuple comprised of at least two searched attributes identified from theuser search data, wherein the at least two searched attributes are thecategory of the requested promotion and a geographic subdivisionidentified by the location specific data; accessing a conversion ratefor the promotion tuple in a plurality of different geographicsubdivisions; setting a benchmark rate for the promotion tuple, thebenchmark rate configured for establishing a benchmark conversion ratefor each of one or more identification pairs to estimate an achievableconversion rate in a given identification pair when that identificationpair were stocked with adequate supply, wherein the benchmark ratecorresponds to the conversion rate of a different subdivision of theplurality of different geographic subdivisions based on the differentsubdivision satisfying at least one of a prime merchant metric thresholdor a conversion rate threshold, wherein the benchmark rate is set to amaximum conversion rate from one of (a) an average conversion rate forthe promotion tuple in a peer group of different subdivisions or (b) apre-defined percentile of all conversion rates for the promotion tupleacross all subdivisions in the peer group; identifying one or moreproviders in the geographic subdivision having the benchmark rate;transmitting information identifying the one or more providers to a leadgeneration module; and generating a prioritized call list for each ofone or more sales resources, the prioritized call list comprisinginformation identifying the one or more providers.
 2. The methodaccording to claim 1, further comprising: analyzing the geographicsubdivision; and generating two or more regions within the subdivisionbased on one or more of subscriber density or population density.
 3. Themethod according to claim 1, wherein the benchmark rate corresponding tothe conversion rate of a subdivision of the plurality of subdivisions isfurther based on the subdivision satisfying an inventory threshold. 4.The method according to claim 1, wherein the benchmark ratecorresponding to the conversion rate of a subdivision of the pluralityof subdivisions is further based on the subdivision satisfying a primemerchant metric threshold.
 5. The method according to claim 1, thebenchmark rate corresponding to a predefined percentile of one or moreconversion rates of a plurality of subdivisions of a division peer groupin an instance in which user search data fails to meet a predeterminedthreshold.
 6. The method according to claim 1, the benchmark ratecorresponding to a conversion rate of a second identification pairmeeting a given set of supply conditions, the identification paircorresponding to a subdivision of a division peer group, in an instancein which user search data fails to meet a predetermined threshold. 7.The method according to claim 1, further comprising: determining a salesvelocity for an identification pair, wherein the identification pair isdetermined from the search data, the identification pair comprising acategory of promotion and a location identified by the location specificdata, wherein the identification pair is indicative of a plurality ofpromotions.
 8. A computer program comprising at least onecomputer-readable storage medium having computer-executable program codeinstructions stored therein, the computer-executable program codeinstructions comprising program code instructions for: accessing, inreal-time, user search data, the user search data generated by a userinteracting with a promotion and marketing service to identify arequested promotion, the user search data comprising at least locationspecific data; generating a promotion tuple from the search data, thepromotion tuple comprised of at least two searched attributes identifiedfrom the user search data, wherein the at least two searched attributesare the category of the requested promotion and a geographic subdivisionidentified by the location specific data; accessing a conversion ratefor the promotion tuple in a plurality of different geographicsubdivisions; setting a benchmark rate for the promotion tuple, thebenchmark rate configured for establishing a benchmark conversion ratefor each of one or more identification pairs to estimate an achievableconversion rate in a given identification pair when that identificationpair were stocked with adequate supply, wherein the benchmark ratecorresponds to the conversion rate of a different subdivision of theplurality of different geographic subdivisions based on the differentsubdivision satisfying at least one of a prime merchant metric thresholdor a conversion rate threshold, wherein the benchmark rate is set to amaximum conversion rate from one of (a) an average conversion rate forthe promotion tuple in a peer group of different subdivisions or (b) apre-defined percentile of all conversion rates for the promotion tupleacross all subdivisions in the peer group; identifying one or moreproviders in the geographic subdivision having the benchmark rate;transmitting information identifying the one or more providers to a leadgeneration module; and generating a prioritized call list for each ofone or more sales resources, the prioritized call list comprisinginformation identifying the one or more providers.
 9. The computerprogram product according to claim 8, wherein the computer-executableprogram code instructions further comprise program code instructionsfor: analyzing a subdivision; and generating two or more regions withinthe subdivision based on one or more of subscriber density or populationdensity.
 10. The computer program product according to claim 8, whereinthe benchmark rate corresponding to the conversion rate of a subdivisionof the plurality of subdivisions is further based on the subdivisionsatisfying an inventory threshold.
 11. The computer program productaccording to claim 8, wherein the benchmark rate corresponding to theconversion rate of a subdivision of the plurality of subdivisions isfurther based on the subdivision satisfying a prime merchant metricthreshold.
 12. The computer program product according to claim 8, thebenchmark rate corresponding to a predefined percentile of one or moreconversion rates of a plurality of subdivisions of a division peer groupin an instance in which user search data fails to meet a predeterminedthreshold.
 13. The computer program product according to claim 8, thebenchmark rate corresponding to a conversion rate of a secondidentification pair meeting a given set of supply conditions, theidentification pair corresponding to a subdivision of a division peergroup, in an instance in which user search data fails to meet apredetermined threshold.
 14. The computer program product according toclaim 8, wherein the computer-executable program code instructionsfurther comprise program code instructions for: determining a salesvelocity for an identification pair, wherein the identification pair isdetermined from the search data, the identification pair comprising acategory of promotion and a location identified by the location specificdata, wherein the identification pair is indicative of a plurality ofpromotions.
 15. An apparatus comprising at least one processor and atleast one memory including computer program code, the at least onememory and the computer program code configured to, with the processor,cause the apparatus to at least: access, in real-time, user search data,the user search data generated by a user interacting with a promotionand marketing service to identify a requested promotion, the user searchdata comprising at least location specific data; generate a promotiontuple from the search data, the promotion tuple comprised of at leasttwo searched attributes identified from the user search data, whereinthe at least two searched attributes are the category of the requestedpromotion and a geographic subdivision identified by the locationspecific data; access a conversion rate for the promotion tuple in aplurality of different geographic subdivisions; set a benchmark rate forthe promotion tuple, the benchmark rate configured for establishing abenchmark conversion rate for each of one or more identification pairsto estimate an achievable conversion rate in a given identification pairwhen that identification pair were stocked with adequate supply, whereinthe benchmark rate corresponds to the conversion rate of a differentsubdivision of the plurality of different geographic subdivisions basedon the different subdivision satisfying at least one of a prime merchantmetric threshold or a conversion rate threshold, wherein the benchmarkrate is set to a maximum conversion rate from one of (a) an averageconversion rate for the promotion tuple in a peer group of differentsubdivisions or (b) a pre-defined percentile of all conversion rates forthe promotion tuple across all subdivisions in the peer group; identifyone or more providers in the geographic subdivision having the benchmarkrate; transmit information identifying the one or more providers to alead generation module; and generate a prioritized call list for each ofone or more sales resources, the prioritized call list comprisinginformation identifying the one or more providers.
 16. The apparatusaccording to claim 15, wherein the at least one memory and the computerprogram code are further configured to, with the processor, cause theapparatus to: analyze a subdivision; and generate two or more regionswithin the subdivision based on one or more of subscriber density orpopulation density.
 17. The apparatus according to claim 15, wherein thebenchmark rate corresponding to the conversion rate of a subdivision ofthe plurality of subdivisions is further based on the subdivisionsatisfying an inventory threshold.
 18. The method according to claim 1,wherein the benchmark rate corresponding to the conversion rate of asubdivision of the plurality of subdivisions is further based on thesubdivision satisfying a prime merchant metric threshold.
 19. Theapparatus according to claim 15, the benchmark rate corresponding to apredefined percentile of one or more conversion rates of a plurality ofsubdivisions of a division peer group in an instance in which usersearch data fails to meet a predetermined threshold.
 20. The apparatusaccording to claim 15, the benchmark rate corresponding to a conversionrate of a second identification pair meeting a given set of supplyconditions, the identification pair corresponding to a subdivision of adivision peer group, in an instance in which user search data fails tomeet a predetermined threshold.
 21. The apparatus according to claim 15,wherein the at least one memory and the computer program code arefurther configured to, with the processor, cause the apparatus to:determine a sales velocity for an identification pair, wherein theidentification pair is determined from the search data, theidentification pair comprising a category of promotion and a locationidentified by the location specific data, wherein the identificationpair is indicative of a plurality of promotions.